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:243-B | codeforces | 243-B | Hydra | https://codeforces.com/problemset/problem/243/B | [
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1330
} | 2026-06-01T05:00:40.145500+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": 4480
} | 2026-06-01T05:00:40.145500+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": 11998
} | 2026-06-01T05:00:40.145500+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": 2032
} | 2026-06-01T05:00:40.145500+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": 11072
} | 2026-06-01T05:00:40.145500+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": 17402
} | 2026-06-01T05:00:40.145500+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": 6822
} | 2026-06-01T05:00:40.145500+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": 565
} | 2026-06-01T05:00:40.145500+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": 292
} | 2026-06-01T05:00:40.145500+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": 1400
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:241-D | codeforces | 241-D | Numbers | https://codeforces.com/problemset/problem/241/D | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 395
} | 2026-06-01T05:00:40.145500+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": 533
} | 2026-06-01T05:00:40.145500+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": 985
} | 2026-06-01T05:00:40.145500+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": 2416
} | 2026-06-01T05:00:40.145500+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": 2280
} | 2026-06-01T05:00:40.145500+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": 431
} | 2026-06-01T05:00:40.145500+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": 1479
} | 2026-06-01T05:00:40.145500+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": 20670
} | 2026-06-01T05:00:40.145500+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": 501
} | 2026-06-01T05:00:40.145500+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": 268
} | 2026-06-01T05:00:40.145500+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": 1366
} | 2026-06-01T05:00:40.145500+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": 1423
} | 2026-06-01T05:00:40.145500+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": 2187
} | 2026-06-01T05:00:40.145500+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": 2017
} | 2026-06-01T05:00:40.145500+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": 621
} | 2026-06-01T05:00:40.145500+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": 6789
} | 2026-06-01T05:00:40.145500+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": 2376
} | 2026-06-01T05:00:40.145500+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": 29607
} | 2026-06-01T05:00:40.145500+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": 17246
} | 2026-06-01T05:00:40.145500+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": 282560
} | 2026-06-01T05:00:40.145500+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": 887
} | 2026-06-01T05:00:40.145500+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": 576
} | 2026-06-01T05:00:40.145500+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": 2482
} | 2026-06-01T05:00:40.145500+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": 4335
} | 2026-06-01T05:00:40.145500+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": 21139
} | 2026-06-01T05:00:40.145500+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": 619
} | 2026-06-01T05:00:40.145500+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": 1589
} | 2026-06-01T05:00:40.145500+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": 1972
} | 2026-06-01T05:00:40.145500+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": 1051
} | 2026-06-01T05:00:40.145500+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": 1607
} | 2026-06-01T05:00:40.145500+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": 5964
} | 2026-06-01T05:00:40.145500+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": 7710
} | 2026-06-01T05:00:40.145500+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": 4690
} | 2026-06-01T05:00:40.145500+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": 8306
} | 2026-06-01T05:00:40.145500+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": 49400
} | 2026-06-01T05:00:40.145500+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": 891
} | 2026-06-01T05:00:40.145500+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": 523
} | 2026-06-01T05:00:40.145500+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": 311
} | 2026-06-01T05:00:40.145500+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": 1680
} | 2026-06-01T05:00:40.145500+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": 2845
} | 2026-06-01T05:00:40.145500+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": 2332
} | 2026-06-01T05:00:40.145500+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": 4337
} | 2026-06-01T05:00:40.145500+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": 9759
} | 2026-06-01T05:00:40.145500+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": 3932
} | 2026-06-01T05:00:40.145500+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": 434235
} | 2026-06-01T05:00:40.145500+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": 96738
} | 2026-06-01T05:00:40.145500+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": 98404
} | 2026-06-01T05:00:40.145500+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": 525
} | 2026-06-01T05:00:40.145500+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": 2624
} | 2026-06-01T05:00:40.145500+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": 1783
} | 2026-06-01T05:00:40.145500+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": 5826
} | 2026-06-01T05:00:40.145500+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": 3759
} | 2026-06-01T05:00:40.145500+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": 2840
} | 2026-06-01T05:00:40.145500+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": 439
} | 2026-06-01T05:00:40.145500+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": 550
} | 2026-06-01T05:00:40.145500+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": 3642
} | 2026-06-01T05:00:40.145500+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": 140972
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:227-B | codeforces | 227-B | Effective Approach | https://codeforces.com/problemset/problem/227/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 32607
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:227-A | codeforces | 227-A | Where do I Turn? | https://codeforces.com/problemset/problem/227/A | [
"geometry"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4604
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:226-E | codeforces | 226-E | Noble Knight's Path | https://codeforces.com/problemset/problem/226/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 551
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:226-D | codeforces | 226-D | The table | https://codeforces.com/problemset/problem/226/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1126
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:226-C | codeforces | 226-C | Anniversary | https://codeforces.com/problemset/problem/226/C | [
"data structures",
"implementation",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1017
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:226-B | codeforces | 226-B | Naughty Stone Piles | https://codeforces.com/problemset/problem/226/B | [
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1712
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:226-A | codeforces | 226-A | Flying Saucer Segments | https://codeforces.com/problemset/problem/226/A | [
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:225-E | codeforces | 225-E | Unsolvable | https://codeforces.com/problemset/problem/225/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 903
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:225-D | codeforces | 225-D | Snake | https://codeforces.com/problemset/problem/225/D | [
"bitmasks",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1055
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:225-C | codeforces | 225-C | Barcode | https://codeforces.com/problemset/problem/225/C | [
"dp",
"matrices"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10202
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:225-B | codeforces | 225-B | Well-known Numbers | https://codeforces.com/problemset/problem/225/B | [
"binary search",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3399
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:225-A | codeforces | 225-A | Dice Tower | https://codeforces.com/problemset/problem/225/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14338
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:224-B | codeforces | 224-B | Array | https://codeforces.com/problemset/problem/224/B | [
"bitmasks",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7957
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:224-A | codeforces | 224-A | Parallelepiped | https://codeforces.com/problemset/problem/224/A | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 30402
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:223-E | codeforces | 223-E | Planar Graph | https://codeforces.com/problemset/problem/223/E | [
"flows",
"geometry",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 208
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:223-D | codeforces | 223-D | Spider | https://codeforces.com/problemset/problem/223/D | [
"geometry",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 80
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:223-C | codeforces | 223-C | Partial Sums | https://codeforces.com/problemset/problem/223/C | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1756
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:223-B | codeforces | 223-B | Two Strings | https://codeforces.com/problemset/problem/223/B | [
"data structures",
"dp",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2036
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:223-A | codeforces | 223-A | Bracket Sequence | https://codeforces.com/problemset/problem/223/A | [
"data structures",
"expression parsing",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2821
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:222-E | codeforces | 222-E | Decoding Genome | https://codeforces.com/problemset/problem/222/E | [
"dp",
"matrices"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3616
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:222-D | codeforces | 222-D | Olympiad | https://codeforces.com/problemset/problem/222/D | [
"binary search",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2347
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:222-C | codeforces | 222-C | Reducing Fractions | https://codeforces.com/problemset/problem/222/C | [
"implementation",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2950
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:222-B | codeforces | 222-B | Cosmic Tables | https://codeforces.com/problemset/problem/222/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6580
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:222-A | codeforces | 222-A | Shooshuns and Sequence | https://codeforces.com/problemset/problem/222/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11831
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:221-B | codeforces | 221-B | Little Elephant and Numbers | https://codeforces.com/problemset/problem/221/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4915
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:221-A | codeforces | 221-A | Little Elephant and Function | https://codeforces.com/problemset/problem/221/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16850
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:220-E | codeforces | 220-E | Little Elephant and Inversions | https://codeforces.com/problemset/problem/220/E | [
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1726
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:220-D | codeforces | 220-D | Little Elephant and Triangle | https://codeforces.com/problemset/problem/220/D | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 315
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:220-C | codeforces | 220-C | Little Elephant and Shifts | https://codeforces.com/problemset/problem/220/C | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1039
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:220-B | codeforces | 220-B | Little Elephant and Array | https://codeforces.com/problemset/problem/220/B | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 13018
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:220-A | codeforces | 220-A | Little Elephant and Problem | https://codeforces.com/problemset/problem/220/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13153
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:219-E | codeforces | 219-E | Parking Lot | https://codeforces.com/problemset/problem/219/E | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 698
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:219-D | codeforces | 219-D | Choosing Capital for Treeland | https://codeforces.com/problemset/problem/219/D | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12608
} | 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.