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:367-D | codeforces | 367-D | Sereja and Sets | https://codeforces.com/problemset/problem/367/D | [
"bitmasks",
"dfs and similar"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 689
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:367-C | codeforces | 367-C | Sereja and the Arrangement of Numbers | https://codeforces.com/problemset/problem/367/C | [
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1925
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:367-B | codeforces | 367-B | Sereja ans Anagrams | https://codeforces.com/problemset/problem/367/B | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2710
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:367-A | codeforces | 367-A | Sereja and Algorithm | https://codeforces.com/problemset/problem/367/A | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4550
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:366-E | codeforces | 366-E | Dima and Magic Guitar | https://codeforces.com/problemset/problem/366/E | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 846
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:366-D | codeforces | 366-D | Dima and Trap Graph | https://codeforces.com/problemset/problem/366/D | [
"binary search",
"data structures",
"dfs and similar",
"dsu",
"shortest paths",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1730
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:366-C | codeforces | 366-C | Dima and Salad | https://codeforces.com/problemset/problem/366/C | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5933
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:366-B | codeforces | 366-B | Dima and To-do List | https://codeforces.com/problemset/problem/366/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7159
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:366-A | codeforces | 366-A | Dima and Guards | https://codeforces.com/problemset/problem/366/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4816
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:365-B | codeforces | 365-B | The Fibonacci Segment | https://codeforces.com/problemset/problem/365/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15403
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:365-A | codeforces | 365-A | Good Number | https://codeforces.com/problemset/problem/365/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23090
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:364-E | codeforces | 364-E | Empty Rectangles | https://codeforces.com/problemset/problem/364/E | [
"divide and conquer",
"two pointers"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 630
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:364-D | codeforces | 364-D | Ghd | https://codeforces.com/problemset/problem/364/D | [
"brute force",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 2525
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:364-C | codeforces | 364-C | Beautiful Set | https://codeforces.com/problemset/problem/364/C | [
"brute force",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 641
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:364-B | codeforces | 364-B | Free Market | https://codeforces.com/problemset/problem/364/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1255
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:364-A | codeforces | 364-A | Matrix | https://codeforces.com/problemset/problem/364/A | [
"combinatorics",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4963
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:363-E | codeforces | 363-E | Two Circles | https://codeforces.com/problemset/problem/363/E | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 226
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:363-D | codeforces | 363-D | Renting Bikes | https://codeforces.com/problemset/problem/363/D | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4344
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:363-C | codeforces | 363-C | Fixing Typos | https://codeforces.com/problemset/problem/363/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14135
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:363-B | codeforces | 363-B | Fence | https://codeforces.com/problemset/problem/363/B | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 67732
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:363-A | codeforces | 363-A | Soroban | https://codeforces.com/problemset/problem/363/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11450
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:362-E | codeforces | 362-E | Petya and Pipes | https://codeforces.com/problemset/problem/362/E | [
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 896
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:362-D | codeforces | 362-D | Fools and Foolproof Roads | https://codeforces.com/problemset/problem/362/D | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1023
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:362-C | codeforces | 362-C | Insertion Sort | https://codeforces.com/problemset/problem/362/C | [
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2026
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:362-B | codeforces | 362-B | Petya and Staircases | https://codeforces.com/problemset/problem/362/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14750
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:362-A | codeforces | 362-A | Two Semiknights Meet | https://codeforces.com/problemset/problem/362/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2808
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:361-B | codeforces | 361-B | Levko and Permutation | https://codeforces.com/problemset/problem/361/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8809
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:361-A | codeforces | 361-A | Levko and Table | https://codeforces.com/problemset/problem/361/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17853
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:360-E | codeforces | 360-E | Levko and Game | https://codeforces.com/problemset/problem/360/E | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 818
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:360-D | codeforces | 360-D | Levko and Sets | https://codeforces.com/problemset/problem/360/D | [
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 489
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:360-C | codeforces | 360-C | Levko and Strings | https://codeforces.com/problemset/problem/360/C | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1233
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:360-B | codeforces | 360-B | Levko and Array | https://codeforces.com/problemset/problem/360/B | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3509
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:360-A | codeforces | 360-A | Levko and Array Recovery | https://codeforces.com/problemset/problem/360/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2142
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:359-E | codeforces | 359-E | Neatness | https://codeforces.com/problemset/problem/359/E | [
"constructive algorithms",
"dfs and similar"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 519
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:359-D | codeforces | 359-D | Pair of Numbers | https://codeforces.com/problemset/problem/359/D | [
"binary search",
"brute force",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:359-C | codeforces | 359-C | Prime Number | https://codeforces.com/problemset/problem/359/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3581
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:359-B | codeforces | 359-B | Permutation | https://codeforces.com/problemset/problem/359/B | [
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8727
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:359-A | codeforces | 359-A | Table | https://codeforces.com/problemset/problem/359/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:358-E | codeforces | 358-E | Dima and Kicks | https://codeforces.com/problemset/problem/358/E | [
"brute force",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 433
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:358-D | codeforces | 358-D | Dima and Hares | https://codeforces.com/problemset/problem/358/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4518
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:358-C | codeforces | 358-C | Dima and Containers | https://codeforces.com/problemset/problem/358/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2289
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:358-B | codeforces | 358-B | Dima and Text Messages | https://codeforces.com/problemset/problem/358/B | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3909
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:358-A | codeforces | 358-A | Dima and Continuous Line | https://codeforces.com/problemset/problem/358/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8151
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:357-B | codeforces | 357-B | Flag Day | https://codeforces.com/problemset/problem/357/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:357-A | codeforces | 357-A | Group of Students | https://codeforces.com/problemset/problem/357/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7715
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:356-E | codeforces | 356-E | Xenia and String Problem | https://codeforces.com/problemset/problem/356/E | [
"dp",
"hashing",
"implementation",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 490
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:356-D | codeforces | 356-D | Bags and Coins | https://codeforces.com/problemset/problem/356/D | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1093
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:356-C | codeforces | 356-C | Compartments | https://codeforces.com/problemset/problem/356/C | [
"combinatorics",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1398
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:356-B | codeforces | 356-B | Xenia and Hamming | https://codeforces.com/problemset/problem/356/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2091
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:356-A | codeforces | 356-A | Knight Tournament | https://codeforces.com/problemset/problem/356/A | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16885
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:355-B | codeforces | 355-B | Vasya and Public Transport | https://codeforces.com/problemset/problem/355/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4913
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:355-A | codeforces | 355-A | Vasya and Digital Root | https://codeforces.com/problemset/problem/355/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9850
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:354-E | codeforces | 354-E | Lucky Number Representation | https://codeforces.com/problemset/problem/354/E | [
"constructive algorithms",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 913
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:354-D | codeforces | 354-D | Transferring Pyramid | https://codeforces.com/problemset/problem/354/D | [
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 500
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:354-C | codeforces | 354-C | Vasya and Beautiful Arrays | https://codeforces.com/problemset/problem/354/C | [
"brute force",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3345
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:354-B | codeforces | 354-B | Game with Strings | https://codeforces.com/problemset/problem/354/B | [
"bitmasks",
"dp",
"games"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 504
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:354-A | codeforces | 354-A | Vasya and Robot | https://codeforces.com/problemset/problem/354/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5664
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:353-E | codeforces | 353-E | Antichain | https://codeforces.com/problemset/problem/353/E | [
"dp",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 675
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:353-D | codeforces | 353-D | Queue | https://codeforces.com/problemset/problem/353/D | [
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3191
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:353-C | codeforces | 353-C | Find Maximum | https://codeforces.com/problemset/problem/353/C | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5269
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:353-B | codeforces | 353-B | Two Heaps | https://codeforces.com/problemset/problem/353/B | [
"combinatorics",
"constructive algorithms",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2439
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:353-A | codeforces | 353-A | Domino | https://codeforces.com/problemset/problem/353/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20033
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:352-B | codeforces | 352-B | Jeff and Periods | https://codeforces.com/problemset/problem/352/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18211
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:352-A | codeforces | 352-A | Jeff and Digits | https://codeforces.com/problemset/problem/352/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28676
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:351-E | codeforces | 351-E | Jeff and Permutation | https://codeforces.com/problemset/problem/351/E | [
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1795
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:351-D | codeforces | 351-D | Jeff and Removing Periods | https://codeforces.com/problemset/problem/351/D | [
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1353
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:351-C | codeforces | 351-C | Jeff and Brackets | https://codeforces.com/problemset/problem/351/C | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 634
} | 2026-06-01T05:00:40.145500+00:00 |
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": 2732
} | 2026-06-01T05:00:40.145500+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": 3102
} | 2026-06-01T05:00:40.145500+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": 861
} | 2026-06-01T05:00:40.145500+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": 296
} | 2026-06-01T05:00:40.145500+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": 6835
} | 2026-06-01T05:00:40.145500+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": 3403
} | 2026-06-01T05:00:40.145500+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": 17570
} | 2026-06-01T05:00:40.145500+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": 15158
} | 2026-06-01T05:00:40.145500+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": 33844
} | 2026-06-01T05:00:40.145500+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": 514
} | 2026-06-01T05:00:40.145500+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": 2232
} | 2026-06-01T05:00:40.145500+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": 2780
} | 2026-06-01T05:00:40.145500+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": 2286
} | 2026-06-01T05:00:40.145500+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": 14769
} | 2026-06-01T05:00:40.145500+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": 9881
} | 2026-06-01T05:00:40.145500+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": 9824
} | 2026-06-01T05:00:40.145500+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": 294
} | 2026-06-01T05:00:40.145500+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": 843
} | 2026-06-01T05:00:40.145500+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": 1508
} | 2026-06-01T05:00:40.145500+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": 4295
} | 2026-06-01T05:00:40.145500+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": 9365
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 52
} | 2026-06-01T05:00:40.145500+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": 55
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 534
} | 2026-06-01T05:00:40.145500+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": 9612
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:344-A | codeforces | 344-A | Magnets | https://codeforces.com/problemset/problem/344/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 154625
} | 2026-06-01T05:00:40.145500+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": 916
} | 2026-06-01T05:00:40.145500+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": 6921
} | 2026-06-01T05:00:40.145500+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": 3217
} | 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.