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:251-C | codeforces | 251-C | Number Transformation | https://codeforces.com/problemset/problem/251/C | [
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1161
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:251-B | codeforces | 251-B | Playing with Permutations | https://codeforces.com/problemset/problem/251/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1387
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:251-A | codeforces | 251-A | Points on Line | https://codeforces.com/problemset/problem/251/A | [
"binary search",
"combinatorics",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21925
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:250-E | codeforces | 250-E | Mad Joe | https://codeforces.com/problemset/problem/250/E | [
"brute force"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 524
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:250-D | codeforces | 250-D | Building Bridge | https://codeforces.com/problemset/problem/250/D | [
"geometry",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1041
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:250-C | codeforces | 250-C | Movie Critics | https://codeforces.com/problemset/problem/250/C | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2248
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:250-B | codeforces | 250-B | Restoring IPv6 | https://codeforces.com/problemset/problem/250/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2281
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:250-A | codeforces | 250-A | Paper Work | https://codeforces.com/problemset/problem/250/A | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 4912
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:249-E | codeforces | 249-E | Endless Matrix | https://codeforces.com/problemset/problem/249/E | [
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 397
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:249-D | codeforces | 249-D | Donkey and Stars | https://codeforces.com/problemset/problem/249/D | [
"data structures",
"dp",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 601
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:248-E | codeforces | 248-E | Piglet's Birthday | https://codeforces.com/problemset/problem/248/E | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 693
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:248-D | codeforces | 248-D | Sweets for Everyone! | https://codeforces.com/problemset/problem/248/D | [
"binary search",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 551
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:248-C | codeforces | 248-C | Robo-Footballer | https://codeforces.com/problemset/problem/248/C | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 912
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:248-B | codeforces | 248-B | Chilly Willy | https://codeforces.com/problemset/problem/248/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5883
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:248-A | codeforces | 248-A | Cupboards | https://codeforces.com/problemset/problem/248/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25432
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:246-E | codeforces | 246-E | Blood Cousins Return | https://codeforces.com/problemset/problem/246/E | [
"binary search",
"data structures",
"dfs and similar",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 4785
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:246-D | codeforces | 246-D | Colorful Graph | https://codeforces.com/problemset/problem/246/D | [
"brute force",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10405
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:246-C | codeforces | 246-C | Beauty Pageant | https://codeforces.com/problemset/problem/246/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2849
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:246-B | codeforces | 246-B | Increase and Decrease | https://codeforces.com/problemset/problem/246/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12410
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:246-A | codeforces | 246-A | Buggy Sorting | https://codeforces.com/problemset/problem/246/A | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10329
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:245-H | codeforces | 245-H | Queries for Number of Palindromes | https://codeforces.com/problemset/problem/245/H | [
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9567
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:245-G | codeforces | 245-G | Suggested Friends | https://codeforces.com/problemset/problem/245/G | [
"brute force",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 564
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:245-F | codeforces | 245-F | Log Stream Analysis | https://codeforces.com/problemset/problem/245/F | [
"binary search",
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1001
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:245-E | codeforces | 245-E | Mishap in Club | https://codeforces.com/problemset/problem/245/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3544
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:245-D | codeforces | 245-D | Restoring Table | https://codeforces.com/problemset/problem/245/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2935
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:245-C | codeforces | 245-C | Game with Coins | https://codeforces.com/problemset/problem/245/C | [
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1703
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:245-B | codeforces | 245-B | Internet Address | https://codeforces.com/problemset/problem/245/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5555
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:245-A | codeforces | 245-A | System Administrator | https://codeforces.com/problemset/problem/245/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 9211
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:244-B | codeforces | 244-B | Undoubtedly Lucky Numbers | https://codeforces.com/problemset/problem/244/B | [
"bitmasks",
"brute force",
"dfs and similar"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4974
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:244-A | codeforces | 244-A | Dividing Orange | https://codeforces.com/problemset/problem/244/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 8643
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:243-E | codeforces | 243-E | Matrix | https://codeforces.com/problemset/problem/243/E | [
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 289
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:243-D | codeforces | 243-D | Cubes | https://codeforces.com/problemset/problem/243/D | [
"data structures",
"dp",
"geometry",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 252
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:243-C | codeforces | 243-C | Colorado Potato Beetle | https://codeforces.com/problemset/problem/243/C | [
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 592
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:243-B | codeforces | 243-B | Hydra | https://codeforces.com/problemset/problem/243/B | [
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1362
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:243-A | codeforces | 243-A | The Brand New Function | https://codeforces.com/problemset/problem/243/A | [
"bitmasks"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4527
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:242-E | codeforces | 242-E | XOR on Segment | https://codeforces.com/problemset/problem/242/E | [
"bitmasks",
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 12392
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:242-D | codeforces | 242-D | Dispute | https://codeforces.com/problemset/problem/242/D | [
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2071
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:242-C | codeforces | 242-C | King's Path | https://codeforces.com/problemset/problem/242/C | [
"dfs and similar",
"graphs",
"hashing",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11566
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:242-B | codeforces | 242-B | Big Segment | https://codeforces.com/problemset/problem/242/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17535
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:242-A | codeforces | 242-A | Heads or Tails | https://codeforces.com/problemset/problem/242/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 6898
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:241-G | codeforces | 241-G | Challenging Balloons | https://codeforces.com/problemset/problem/241/G | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 568
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:241-F | codeforces | 241-F | Race | https://codeforces.com/problemset/problem/241/F | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 306
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:241-E | codeforces | 241-E | Flights | https://codeforces.com/problemset/problem/241/E | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1476
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:241-D | codeforces | 241-D | Numbers | https://codeforces.com/problemset/problem/241/D | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 417
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:241-C | codeforces | 241-C | Mirror Box | https://codeforces.com/problemset/problem/241/C | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 547
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:241-B | codeforces | 241-B | Friends | https://codeforces.com/problemset/problem/241/B | [
"binary search",
"bitmasks",
"data structures",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1041
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:241-A | codeforces | 241-A | Old Peykan | https://codeforces.com/problemset/problem/241/A | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2437
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:240-F | codeforces | 240-F | TorCoder | https://codeforces.com/problemset/problem/240/F | [
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2337
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:240-E | codeforces | 240-E | Road Repairs | https://codeforces.com/problemset/problem/240/E | [
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 440
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:239-B | codeforces | 239-B | Easy Tape Programming | https://codeforces.com/problemset/problem/239/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1488
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:239-A | codeforces | 239-A | Two Bags of Potatoes | https://codeforces.com/problemset/problem/239/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20875
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:238-E | codeforces | 238-E | Meeting Her | https://codeforces.com/problemset/problem/238/E | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 529
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:238-D | codeforces | 238-D | Tape Programming | https://codeforces.com/problemset/problem/238/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 281
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:238-C | codeforces | 238-C | World Eater Brothers | https://codeforces.com/problemset/problem/238/C | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1398
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:238-B | codeforces | 238-B | Boring Partition | https://codeforces.com/problemset/problem/238/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1428
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:238-A | codeforces | 238-A | Not Wool Sequences | https://codeforces.com/problemset/problem/238/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2212
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:237-E | codeforces | 237-E | Build String | https://codeforces.com/problemset/problem/237/E | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2053
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:237-D | codeforces | 237-D | T-decomposition | https://codeforces.com/problemset/problem/237/D | [
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 646
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:237-C | codeforces | 237-C | Primes on Interval | https://codeforces.com/problemset/problem/237/C | [
"binary search",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6857
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:237-B | codeforces | 237-B | Young Table | https://codeforces.com/problemset/problem/237/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2385
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:237-A | codeforces | 237-A | Free Cash | https://codeforces.com/problemset/problem/237/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29892
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:236-B | codeforces | 236-B | Easy Number Challenge | https://codeforces.com/problemset/problem/236/B | [
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17570
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:236-A | codeforces | 236-A | Boy or Girl | https://codeforces.com/problemset/problem/236/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 291291
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:235-E | codeforces | 235-E | Number Challenge | https://codeforces.com/problemset/problem/235/E | [
"combinatorics",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 989
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:235-D | codeforces | 235-D | Graph Game | https://codeforces.com/problemset/problem/235/D | [
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 721
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:235-C | codeforces | 235-C | Cyclical Quest | https://codeforces.com/problemset/problem/235/C | [
"data structures",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 2564
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:235-B | codeforces | 235-B | Let's Play Osu! | https://codeforces.com/problemset/problem/235/B | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4500
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:235-A | codeforces | 235-A | LCM Challenge | https://codeforces.com/problemset/problem/235/A | [
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 21539
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:234-H | codeforces | 234-H | Merging Two Decks | https://codeforces.com/problemset/problem/234/H | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 626
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:234-G | codeforces | 234-G | Practice | https://codeforces.com/problemset/problem/234/G | [
"constructive algorithms",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1598
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:234-F | codeforces | 234-F | Fence | https://codeforces.com/problemset/problem/234/F | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2007
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:234-E | codeforces | 234-E | Champions' League | https://codeforces.com/problemset/problem/234/E | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1059
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:234-D | codeforces | 234-D | Cinema | https://codeforces.com/problemset/problem/234/D | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1609
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:234-C | codeforces | 234-C | Weather | https://codeforces.com/problemset/problem/234/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6013
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:234-B | codeforces | 234-B | Reading | https://codeforces.com/problemset/problem/234/B | [
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7769
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:234-A | codeforces | 234-A | Lefthanders and Righthanders | https://codeforces.com/problemset/problem/234/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4715
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:233-B | codeforces | 233-B | Non-square Equation | https://codeforces.com/problemset/problem/233/B | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8380
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:233-A | codeforces | 233-A | Perfect Permutation | https://codeforces.com/problemset/problem/233/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 50092
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:232-E | codeforces | 232-E | Quick Tortoise | https://codeforces.com/problemset/problem/232/E | [
"bitmasks",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1026
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:232-D | codeforces | 232-D | Fence | https://codeforces.com/problemset/problem/232/D | [
"binary search",
"data structures",
"string suffix structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 582
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:232-C | codeforces | 232-C | Doe Graphs | https://codeforces.com/problemset/problem/232/C | [
"constructive algorithms",
"divide and conquer",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 341
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:232-B | codeforces | 232-B | Table | https://codeforces.com/problemset/problem/232/B | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1697
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:232-A | codeforces | 232-A | Cycles | https://codeforces.com/problemset/problem/232/A | [
"binary search",
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2861
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:231-E | codeforces | 231-E | Cactus | https://codeforces.com/problemset/problem/231/E | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2383
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:231-D | codeforces | 231-D | Magic Box | https://codeforces.com/problemset/problem/231/D | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4365
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:231-C | codeforces | 231-C | To Add or Not to Add | https://codeforces.com/problemset/problem/231/C | [
"binary search",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9873
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:231-B | codeforces | 231-B | Magic, Wizardry and Wonders | https://codeforces.com/problemset/problem/231/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3980
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:231-A | codeforces | 231-A | Team | https://codeforces.com/problemset/problem/231/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 446920
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:230-B | codeforces | 230-B | T-primes | https://codeforces.com/problemset/problem/230/B | [
"binary search",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 99923
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:230-A | codeforces | 230-A | Dragons | https://codeforces.com/problemset/problem/230/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 101936
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:229-E | codeforces | 229-E | Gifts | https://codeforces.com/problemset/problem/229/E | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 619
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:229-D | codeforces | 229-D | Towers | https://codeforces.com/problemset/problem/229/D | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2669
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:229-C | codeforces | 229-C | Triangles | https://codeforces.com/problemset/problem/229/C | [
"combinatorics",
"graphs",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1793
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:229-B | codeforces | 229-B | Planets | https://codeforces.com/problemset/problem/229/B | [
"binary search",
"data structures",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6010
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:229-A | codeforces | 229-A | Shifts | https://codeforces.com/problemset/problem/229/A | [
"brute force",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3788
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:228-E | codeforces | 228-E | The Road to Berland is Paved With Good Intentions | https://codeforces.com/problemset/problem/228/E | [
"2-sat",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2867
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:228-D | codeforces | 228-D | Zigzag | https://codeforces.com/problemset/problem/228/D | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 466
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:228-C | codeforces | 228-C | Fractal Detector | https://codeforces.com/problemset/problem/228/C | [
"dp",
"hashing"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 564
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:228-B | codeforces | 228-B | Two Tables | https://codeforces.com/problemset/problem/228/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3662
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:228-A | codeforces | 228-A | Is your horseshoe on the other hoof? | https://codeforces.com/problemset/problem/228/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 144751
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.