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:351-B | codeforces | 351-B | Jeff and Furik | https://codeforces.com/problemset/problem/351/B | [
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2793
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:351-A | codeforces | 351-A | Jeff and Rounding | https://codeforces.com/problemset/problem/351/A | [
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3110
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:350-E | codeforces | 350-E | Wrong Floyd | https://codeforces.com/problemset/problem/350/E | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 883
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:350-D | codeforces | 350-D | Looking for Owls | https://codeforces.com/problemset/problem/350/D | [
"binary search",
"data structures",
"geometry",
"hashing",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 322
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:350-C | codeforces | 350-C | Bombs | https://codeforces.com/problemset/problem/350/C | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6859
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:350-B | codeforces | 350-B | Resort | https://codeforces.com/problemset/problem/350/B | [
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3431
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:350-A | codeforces | 350-A | TL | https://codeforces.com/problemset/problem/350/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17675
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:349-B | codeforces | 349-B | Color the Fence | https://codeforces.com/problemset/problem/349/B | [
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 15257
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:349-A | codeforces | 349-A | Cinema Line | https://codeforces.com/problemset/problem/349/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 34389
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:348-E | codeforces | 348-E | Pilgrims | https://codeforces.com/problemset/problem/348/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 648
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:348-D | codeforces | 348-D | Turtles | https://codeforces.com/problemset/problem/348/D | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2325
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:348-C | codeforces | 348-C | Subset Sums | https://codeforces.com/problemset/problem/348/C | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2898
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:348-B | codeforces | 348-B | Apple Tree | https://codeforces.com/problemset/problem/348/B | [
"dfs and similar",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2318
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:348-A | codeforces | 348-A | Mafia | https://codeforces.com/problemset/problem/348/A | [
"binary search",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14965
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:347-B | codeforces | 347-B | Fixed Points | https://codeforces.com/problemset/problem/347/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9936
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:347-A | codeforces | 347-A | Difference Row | https://codeforces.com/problemset/problem/347/A | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9879
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:346-E | codeforces | 346-E | Doodle Jump | https://codeforces.com/problemset/problem/346/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 384
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:346-D | codeforces | 346-D | Robot Control | https://codeforces.com/problemset/problem/346/D | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 889
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:346-C | codeforces | 346-C | Number Transformation II | https://codeforces.com/problemset/problem/346/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1527
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:346-B | codeforces | 346-B | Lucky Common Subsequence | https://codeforces.com/problemset/problem/346/B | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4430
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:346-A | codeforces | 346-A | Alice and Bob | https://codeforces.com/problemset/problem/346/A | [
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9423
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:345-G | codeforces | 345-G | Suffix Subgroup | https://codeforces.com/problemset/problem/345/G | [
"*special",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 105
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:345-F | codeforces | 345-F | Superstitions Inspection | https://codeforces.com/problemset/problem/345/F | [
"*special"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 55
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:345-E | codeforces | 345-E | Black Cat Rush | https://codeforces.com/problemset/problem/345/E | [
"*special"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 57
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:345-D | codeforces | 345-D | Chain Letter | https://codeforces.com/problemset/problem/345/D | [
"*special",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 83
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:345-C | codeforces | 345-C | Counting Fridays | https://codeforces.com/problemset/problem/345/C | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 130
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:345-B | codeforces | 345-B | Triskaidekaphobia | https://codeforces.com/problemset/problem/345/B | [
"*special"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 129
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:345-A | codeforces | 345-A | Expecting Trouble | https://codeforces.com/problemset/problem/345/A | [
"*special",
"probabilities"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 549
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:344-B | codeforces | 344-B | Simple Molecules | https://codeforces.com/problemset/problem/344/B | [
"brute force",
"graphs",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9677
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:344-A | codeforces | 344-A | Magnets | https://codeforces.com/problemset/problem/344/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 157990
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:343-E | codeforces | 343-E | Pumping Stations | https://codeforces.com/problemset/problem/343/E | [
"brute force",
"dfs and similar",
"divide and conquer",
"flows",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 989
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:343-D | codeforces | 343-D | Water Tree | https://codeforces.com/problemset/problem/343/D | [
"data structures",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7273
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:343-C | codeforces | 343-C | Read Time | https://codeforces.com/problemset/problem/343/C | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3236
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:343-B | codeforces | 343-B | Alternating Current | https://codeforces.com/problemset/problem/343/B | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18705
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:343-A | codeforces | 343-A | Rational Resistance | https://codeforces.com/problemset/problem/343/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10189
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:342-E | codeforces | 342-E | Xenia and Tree | https://codeforces.com/problemset/problem/342/E | [
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 11380
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:342-D | codeforces | 342-D | Xenia and Dominoes | https://codeforces.com/problemset/problem/342/D | [
"bitmasks",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 588
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:342-C | codeforces | 342-C | Cupboard and Balloons | https://codeforces.com/problemset/problem/342/C | [
"geometry"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2015
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:342-B | codeforces | 342-B | Xenia and Spies | https://codeforces.com/problemset/problem/342/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4226
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:342-A | codeforces | 342-A | Xenia and Divisors | https://codeforces.com/problemset/problem/342/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14116
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:341-E | codeforces | 341-E | Candies Game | https://codeforces.com/problemset/problem/341/E | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 619
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:341-D | codeforces | 341-D | Iahub and Xors | https://codeforces.com/problemset/problem/341/D | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1432
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:340-E | codeforces | 340-E | Iahub and Permutations | https://codeforces.com/problemset/problem/340/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2828
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:340-D | codeforces | 340-D | Bubble Sort Graph | https://codeforces.com/problemset/problem/340/D | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8021
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:340-C | codeforces | 340-C | Tourist Problem | https://codeforces.com/problemset/problem/340/C | [
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4735
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:340-B | codeforces | 340-B | Maximal Area Quadrilateral | https://codeforces.com/problemset/problem/340/B | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2392
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:340-A | codeforces | 340-A | The Wall | https://codeforces.com/problemset/problem/340/A | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8425
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:339-E | codeforces | 339-E | Three Swaps | https://codeforces.com/problemset/problem/339/E | [
"constructive algorithms",
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 610
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:339-D | codeforces | 339-D | Xenia and Bit Operations | https://codeforces.com/problemset/problem/339/D | [
"data structures",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 34018
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:339-C | codeforces | 339-C | Xenia and Weights | https://codeforces.com/problemset/problem/339/C | [
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8822
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:339-B | codeforces | 339-B | Xenia and Ringroad | https://codeforces.com/problemset/problem/339/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 83328
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:339-A | codeforces | 339-A | Helpful Maths | https://codeforces.com/problemset/problem/339/A | [
"greedy",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 285371
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:338-E | codeforces | 338-E | Optimize! | https://codeforces.com/problemset/problem/338/E | [
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1225
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:338-D | codeforces | 338-D | GCD Table | https://codeforces.com/problemset/problem/338/D | [
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1504
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:337-E | codeforces | 337-E | Divisor Tree | https://codeforces.com/problemset/problem/337/E | [
"brute force",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1160
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:337-D | codeforces | 337-D | Book of Evil | https://codeforces.com/problemset/problem/337/D | [
"dfs and similar",
"divide and conquer",
"dp",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7094
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:337-C | codeforces | 337-C | Quiz | https://codeforces.com/problemset/problem/337/C | [
"binary search",
"greedy",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5272
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:337-B | codeforces | 337-B | Routine Problem | https://codeforces.com/problemset/problem/337/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10156
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:337-A | codeforces | 337-A | Puzzles | https://codeforces.com/problemset/problem/337/A | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 97540
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:336-E | codeforces | 336-E | Vasily the Bear and Painting Square | https://codeforces.com/problemset/problem/336/E | [
"bitmasks",
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 158
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:336-D | codeforces | 336-D | Vasily the Bear and Beautiful Strings | https://codeforces.com/problemset/problem/336/D | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1245
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:336-C | codeforces | 336-C | Vasily the Bear and Sequence | https://codeforces.com/problemset/problem/336/C | [
"brute force",
"greedy",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2673
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:336-B | codeforces | 336-B | Vasily the Bear and Fly | https://codeforces.com/problemset/problem/336/B | [
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1375
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:336-A | codeforces | 336-A | Vasily the Bear and Triangle | https://codeforces.com/problemset/problem/336/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10759
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:335-F | codeforces | 335-F | Buy One, Get One Free | https://codeforces.com/problemset/problem/335/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 770
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:335-E | codeforces | 335-E | Counting Skyscrapers | https://codeforces.com/problemset/problem/335/E | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 265
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:335-D | codeforces | 335-D | Rectangles and Square | https://codeforces.com/problemset/problem/335/D | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 372
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:335-C | codeforces | 335-C | More Reclamation | https://codeforces.com/problemset/problem/335/C | [
"games"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 639
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:335-B | codeforces | 335-B | Palindrome | https://codeforces.com/problemset/problem/335/B | [
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2404
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:335-A | codeforces | 335-A | Banana | https://codeforces.com/problemset/problem/335/A | [
"binary search",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2881
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:334-B | codeforces | 334-B | Eight Point Sets | https://codeforces.com/problemset/problem/334/B | [
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3895
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:334-A | codeforces | 334-A | Candy Bags | https://codeforces.com/problemset/problem/334/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20224
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:333-E | codeforces | 333-E | Summer Earnings | https://codeforces.com/problemset/problem/333/E | [
"binary search",
"bitmasks",
"brute force",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1301
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:333-D | codeforces | 333-D | Characteristics of Rectangles | https://codeforces.com/problemset/problem/333/D | [
"binary search",
"bitmasks",
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2273
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:333-C | codeforces | 333-C | Lucky Tickets | https://codeforces.com/problemset/problem/333/C | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 438
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:333-B | codeforces | 333-B | Chips | https://codeforces.com/problemset/problem/333/B | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2780
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:333-A | codeforces | 333-A | Secrets | https://codeforces.com/problemset/problem/333/A | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4303
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:332-E | codeforces | 332-E | Binary Key | https://codeforces.com/problemset/problem/332/E | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 356
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:332-D | codeforces | 332-D | Theft of Blueprints | https://codeforces.com/problemset/problem/332/D | [
"graphs",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 441
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:332-C | codeforces | 332-C | Students' Revenge | https://codeforces.com/problemset/problem/332/C | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1056
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:332-B | codeforces | 332-B | Maximum Absurdity | https://codeforces.com/problemset/problem/332/B | [
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8836
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:332-A | codeforces | 332-A | Down the Hatch! | https://codeforces.com/problemset/problem/332/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3744
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-E2 | codeforces | 331-E2 | Deja Vu | https://codeforces.com/problemset/problem/331/E2 | [
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 237
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-E1 | codeforces | 331-E1 | Deja Vu | https://codeforces.com/problemset/problem/331/E1 | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 218
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-D3 | codeforces | 331-D3 | Escaping on Beaveractor | https://codeforces.com/problemset/problem/331/D3 | [
"data structures",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 206
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-D2 | codeforces | 331-D2 | Escaping on Beaveractor | https://codeforces.com/problemset/problem/331/D2 | [
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 162
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-D1 | codeforces | 331-D1 | Escaping on Beaveractor | https://codeforces.com/problemset/problem/331/D1 | [
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 243
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-C3 | codeforces | 331-C3 | The Great Julya Calendar | https://codeforces.com/problemset/problem/331/C3 | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 632
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-C2 | codeforces | 331-C2 | The Great Julya Calendar | https://codeforces.com/problemset/problem/331/C2 | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 449
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-C1 | codeforces | 331-C1 | The Great Julya Calendar | https://codeforces.com/problemset/problem/331/C1 | [
"dp"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7185
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-B2 | codeforces | 331-B2 | Shave Beaver! | https://codeforces.com/problemset/problem/331/B2 | [
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 839
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-B1 | codeforces | 331-B1 | Shave Beaver! | https://codeforces.com/problemset/problem/331/B1 | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 822
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-A2 | codeforces | 331-A2 | Oh Sweet Beaverette | https://codeforces.com/problemset/problem/331/A2 | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1563
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:331-A1 | codeforces | 331-A1 | Oh Sweet Beaverette | https://codeforces.com/problemset/problem/331/A1 | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1535
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:330-B | codeforces | 330-B | Road Construction | https://codeforces.com/problemset/problem/330/B | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19775
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:330-A | codeforces | 330-A | Cakeminator | https://codeforces.com/problemset/problem/330/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31919
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:329-E | codeforces | 329-E | Evil | https://codeforces.com/problemset/problem/329/E | [
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 202
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:329-D | codeforces | 329-D | The Evil Temple and the Moving Rocks | https://codeforces.com/problemset/problem/329/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 442
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:329-C | codeforces | 329-C | Graph Reconstruction | https://codeforces.com/problemset/problem/329/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1031
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:329-B | codeforces | 329-B | Biridian Forest | https://codeforces.com/problemset/problem/329/B | [
"dfs and similar",
"shortest paths"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7710
} | 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.