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:501-C | codeforces | 501-C | Misha and Forest | https://codeforces.com/problemset/problem/501/C | [
"constructive algorithms",
"data structures",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6102
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:501-B | codeforces | 501-B | Misha and Changing Handles | https://codeforces.com/problemset/problem/501/B | [
"data structures",
"dsu",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19798
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:501-A | codeforces | 501-A | Contest | https://codeforces.com/problemset/problem/501/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24463
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:500-G | codeforces | 500-G | New Year Running | https://codeforces.com/problemset/problem/500/G | [
"number theory",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 345
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:500-F | codeforces | 500-F | New Year Shopping | https://codeforces.com/problemset/problem/500/F | [
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 865
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:500-E | codeforces | 500-E | New Year Domino | https://codeforces.com/problemset/problem/500/E | [
"data structures",
"dp",
"dsu"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1618
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:500-D | codeforces | 500-D | New Year Santa Network | https://codeforces.com/problemset/problem/500/D | [
"combinatorics",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3312
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:500-C | codeforces | 500-C | New Year Book Reading | https://codeforces.com/problemset/problem/500/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6060
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:500-B | codeforces | 500-B | New Year Permutation | https://codeforces.com/problemset/problem/500/B | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9724
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:500-A | codeforces | 500-A | New Year Transportation | https://codeforces.com/problemset/problem/500/A | [
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 64577
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:499-B | codeforces | 499-B | Lecture | https://codeforces.com/problemset/problem/499/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 45667
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:499-A | codeforces | 499-A | Watching a movie | https://codeforces.com/problemset/problem/499/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14832
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:498-E | codeforces | 498-E | Stairs and Lines | https://codeforces.com/problemset/problem/498/E | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 618
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:498-D | codeforces | 498-D | Traffic Jams in the Land | https://codeforces.com/problemset/problem/498/D | [
"data structures",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1276
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:498-C | codeforces | 498-C | Array and Operations | https://codeforces.com/problemset/problem/498/C | [
"flows",
"graph matchings",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4343
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:498-B | codeforces | 498-B | Name That Tune | https://codeforces.com/problemset/problem/498/B | [
"dp",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1322
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:498-A | codeforces | 498-A | Crazy Town | https://codeforces.com/problemset/problem/498/A | [
"geometry"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6947
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:497-E | codeforces | 497-E | Subsequences Return | https://codeforces.com/problemset/problem/497/E | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 357
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:497-D | codeforces | 497-D | Gears | https://codeforces.com/problemset/problem/497/D | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 251
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:496-E | codeforces | 496-E | Distributing Parts | https://codeforces.com/problemset/problem/496/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1808
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:496-D | codeforces | 496-D | Tennis Game | https://codeforces.com/problemset/problem/496/D | [
"binary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3210
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:496-C | codeforces | 496-C | Removing Columns | https://codeforces.com/problemset/problem/496/C | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8222
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:496-B | codeforces | 496-B | Secret Combination | https://codeforces.com/problemset/problem/496/B | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6246
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:496-A | codeforces | 496-A | Minimum Difficulty | https://codeforces.com/problemset/problem/496/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17275
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:495-B | codeforces | 495-B | Modular Equations | https://codeforces.com/problemset/problem/495/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8468
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:495-A | codeforces | 495-A | Digital Counter | https://codeforces.com/problemset/problem/495/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9139
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:494-E | codeforces | 494-E | Sharti | https://codeforces.com/problemset/problem/494/E | [
"data structures",
"games"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 547
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:494-D | codeforces | 494-D | Birthday | https://codeforces.com/problemset/problem/494/D | [
"data structures",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 714
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:494-C | codeforces | 494-C | Helping People | https://codeforces.com/problemset/problem/494/C | [
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 997
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:494-B | codeforces | 494-B | Obsessive String | https://codeforces.com/problemset/problem/494/B | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3258
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:494-A | codeforces | 494-A | Treasure | https://codeforces.com/problemset/problem/494/A | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6587
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:493-E | codeforces | 493-E | Vasya and Polynomial | https://codeforces.com/problemset/problem/493/E | [
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 572
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:493-D | codeforces | 493-D | Vasya and Chess | https://codeforces.com/problemset/problem/493/D | [
"constructive algorithms",
"games",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10290
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:493-C | codeforces | 493-C | Vasya and Basketball | https://codeforces.com/problemset/problem/493/C | [
"binary search",
"brute force",
"data structures",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7587
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:493-B | codeforces | 493-B | Vasya and Wrestling | https://codeforces.com/problemset/problem/493/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14150
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:493-A | codeforces | 493-A | Vasya and Football | https://codeforces.com/problemset/problem/493/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6477
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:492-E | codeforces | 492-E | Vanya and Field | https://codeforces.com/problemset/problem/492/E | [
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1780
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:492-D | codeforces | 492-D | Vanya and Computer Game | https://codeforces.com/problemset/problem/492/D | [
"binary search",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3335
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:492-C | codeforces | 492-C | Vanya and Exams | https://codeforces.com/problemset/problem/492/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15582
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:492-B | codeforces | 492-B | Vanya and Lanterns | https://codeforces.com/problemset/problem/492/B | [
"binary search",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 92918
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:492-A | codeforces | 492-A | Vanya and Cubes | https://codeforces.com/problemset/problem/492/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 65168
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:491-C | codeforces | 491-C | Deciphering | https://codeforces.com/problemset/problem/491/C | [
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 550
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:491-B | codeforces | 491-B | New York Hotel | https://codeforces.com/problemset/problem/491/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 681
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:491-A | codeforces | 491-A | Up the hill | https://codeforces.com/problemset/problem/491/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 3581
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:490-F | codeforces | 490-F | Treeland Tour | https://codeforces.com/problemset/problem/490/F | [
"data structures",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1958
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:490-E | codeforces | 490-E | Restoring Increasing Sequence | https://codeforces.com/problemset/problem/490/E | [
"binary search",
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1726
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:490-D | codeforces | 490-D | Chocolate | https://codeforces.com/problemset/problem/490/D | [
"brute force",
"dfs and similar",
"math",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2333
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:490-C | codeforces | 490-C | Hacking Cypher | https://codeforces.com/problemset/problem/490/C | [
"brute force",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9531
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:490-B | codeforces | 490-B | Queue | https://codeforces.com/problemset/problem/490/B | [
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6509
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:490-A | codeforces | 490-A | Team Olympiad | https://codeforces.com/problemset/problem/490/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 73225
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:489-F | codeforces | 489-F | Special Matrices | https://codeforces.com/problemset/problem/489/F | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1985
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:489-E | codeforces | 489-E | Hiking | https://codeforces.com/problemset/problem/489/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1195
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:489-D | codeforces | 489-D | Unbearable Controversy of Being | https://codeforces.com/problemset/problem/489/D | [
"brute force",
"combinatorics",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7112
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:489-C | codeforces | 489-C | Given Length and Sum of Digits... | https://codeforces.com/problemset/problem/489/C | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 52714
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:489-B | codeforces | 489-B | BerSU Ball | https://codeforces.com/problemset/problem/489/B | [
"dfs and similar",
"dp",
"graph matchings",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 58916
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:489-A | codeforces | 489-A | SwapSort | https://codeforces.com/problemset/problem/489/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10672
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:488-B | codeforces | 488-B | Candy Boxes | https://codeforces.com/problemset/problem/488/B | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2266
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:488-A | codeforces | 488-A | Giga Tower | https://codeforces.com/problemset/problem/488/A | [
"brute force"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15027
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:487-E | codeforces | 487-E | Tourists | https://codeforces.com/problemset/problem/487/E | [
"data structures",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 3052
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:487-D | codeforces | 487-D | Conveyor Belts | https://codeforces.com/problemset/problem/487/D | [
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1054
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:487-C | codeforces | 487-C | Prefix Product Sequence | https://codeforces.com/problemset/problem/487/C | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3164
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:487-B | codeforces | 487-B | Strip | https://codeforces.com/problemset/problem/487/B | [
"binary search",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4392
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:487-A | codeforces | 487-A | Fight the Monster | https://codeforces.com/problemset/problem/487/A | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3982
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:486-E | codeforces | 486-E | LIS of Sequence | https://codeforces.com/problemset/problem/486/E | [
"data structures",
"dp",
"greedy",
"hashing",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2744
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:486-D | codeforces | 486-D | Valid Sets | https://codeforces.com/problemset/problem/486/D | [
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4439
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:486-C | codeforces | 486-C | Palindrome Transformation | https://codeforces.com/problemset/problem/486/C | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12479
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:486-B | codeforces | 486-B | OR in Matrix | https://codeforces.com/problemset/problem/486/B | [
"greedy",
"hashing",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19382
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:486-A | codeforces | 486-A | Calculating Function | https://codeforces.com/problemset/problem/486/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 159344
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:485-B | codeforces | 485-B | Valuable Resources | https://codeforces.com/problemset/problem/485/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6824
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:485-A | codeforces | 485-A | Factory | https://codeforces.com/problemset/problem/485/A | [
"implementation",
"math",
"matrices"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8824
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:484-E | codeforces | 484-E | Sign on Fence | https://codeforces.com/problemset/problem/484/E | [
"binary search",
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3214
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:484-D | codeforces | 484-D | Kindergarten | https://codeforces.com/problemset/problem/484/D | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3108
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:484-C | codeforces | 484-C | Strange Sorting | https://codeforces.com/problemset/problem/484/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 676
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:484-B | codeforces | 484-B | Maximum Value | https://codeforces.com/problemset/problem/484/B | [
"binary search",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7854
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:484-A | codeforces | 484-A | Bits | https://codeforces.com/problemset/problem/484/A | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13795
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:483-B | codeforces | 483-B | Friends and Presents | https://codeforces.com/problemset/problem/483/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4463
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:483-A | codeforces | 483-A | Counterexample | https://codeforces.com/problemset/problem/483/A | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25100
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:482-E | codeforces | 482-E | ELCA | https://codeforces.com/problemset/problem/482/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 203
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:482-D | codeforces | 482-D | Random Function and Tree | https://codeforces.com/problemset/problem/482/D | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 647
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:482-C | codeforces | 482-C | Game with Strings | https://codeforces.com/problemset/problem/482/C | [
"bitmasks",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1034
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:482-B | codeforces | 482-B | Interesting Array | https://codeforces.com/problemset/problem/482/B | [
"constructive algorithms",
"data structures",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7946
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:482-A | codeforces | 482-A | Diverse Permutation | https://codeforces.com/problemset/problem/482/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10295
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:480-E | codeforces | 480-E | Parking Lot | https://codeforces.com/problemset/problem/480/E | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 668
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:480-D | codeforces | 480-D | Parcels | https://codeforces.com/problemset/problem/480/D | [
"dp",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 527
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:479-E | codeforces | 479-E | Riding in a Lift | https://codeforces.com/problemset/problem/479/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5738
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:479-D | codeforces | 479-D | Long Jumps | https://codeforces.com/problemset/problem/479/D | [
"binary search",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5036
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:479-C | codeforces | 479-C | Exams | https://codeforces.com/problemset/problem/479/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 33682
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:479-B | codeforces | 479-B | Towers | https://codeforces.com/problemset/problem/479/B | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8520
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:479-A | codeforces | 479-A | Expression | https://codeforces.com/problemset/problem/479/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 115114
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:478-E | codeforces | 478-E | Wavy numbers | https://codeforces.com/problemset/problem/478/E | [
"brute force",
"dfs and similar",
"meet-in-the-middle",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 260
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:478-D | codeforces | 478-D | Red-Green Towers | https://codeforces.com/problemset/problem/478/D | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7390
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:478-C | codeforces | 478-C | Table Decorations | https://codeforces.com/problemset/problem/478/C | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 20948
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:478-B | codeforces | 478-B | Random Teams | https://codeforces.com/problemset/problem/478/B | [
"combinatorics",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 42013
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:478-A | codeforces | 478-A | Initial Bet | https://codeforces.com/problemset/problem/478/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27402
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:477-E | codeforces | 477-E | Dreamoon and Notepad | https://codeforces.com/problemset/problem/477/E | [
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 166
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:477-D | codeforces | 477-D | Dreamoon and Binary | https://codeforces.com/problemset/problem/477/D | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 621
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:476-E | codeforces | 476-E | Dreamoon and Strings | https://codeforces.com/problemset/problem/476/E | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2156
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:476-D | codeforces | 476-D | Dreamoon and Sets | https://codeforces.com/problemset/problem/476/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5084
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:476-C | codeforces | 476-C | Dreamoon and Sums | https://codeforces.com/problemset/problem/476/C | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6065
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:476-B | codeforces | 476-B | Dreamoon and WiFi | https://codeforces.com/problemset/problem/476/B | [
"bitmasks",
"brute force",
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 38131
} | 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.