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:1575-I | codeforces | 1575-I | Illusions of the Desert | https://codeforces.com/problemset/problem/1575/I | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1022
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-H | codeforces | 1575-H | Holiday Wall Ornaments | https://codeforces.com/problemset/problem/1575/H | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 771
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-G | codeforces | 1575-G | GCD Festival | https://codeforces.com/problemset/problem/1575/G | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 838
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-F | codeforces | 1575-F | Finding Expected Value | https://codeforces.com/problemset/problem/1575/F | [
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 140
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-E | codeforces | 1575-E | Eye-Pleasing City Park Tour | https://codeforces.com/problemset/problem/1575/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 395
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-D | codeforces | 1575-D | Divisible by Twenty-Five | https://codeforces.com/problemset/problem/1575/D | [
"brute force",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2878
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-C | codeforces | 1575-C | Cyclic Sum | https://codeforces.com/problemset/problem/1575/C | [
"data structures",
"fft",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 194
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-B | codeforces | 1575-B | Building an Amusement Park | https://codeforces.com/problemset/problem/1575/B | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 539
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1575-A | codeforces | 1575-A | Another Sorting Problem | https://codeforces.com/problemset/problem/1575/A | [
"data structures",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5212
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1574-F | codeforces | 1574-F | Occurrences | https://codeforces.com/problemset/problem/1574/F | [
"combinatorics",
"dfs and similar",
"dp",
"dsu",
"fft",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 747
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1574-E | codeforces | 1574-E | Coloring | https://codeforces.com/problemset/problem/1574/E | [
"combinatorics",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1040
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1574-D | codeforces | 1574-D | The Strongest Build | https://codeforces.com/problemset/problem/1574/D | [
"binary search",
"brute force",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"hashing",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4862
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1574-C | codeforces | 1574-C | Slay the Dragon | https://codeforces.com/problemset/problem/1574/C | [
"binary search",
"greedy",
"sortings",
"ternary search"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18613
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1574-B | codeforces | 1574-B | Combinatorics Homework | https://codeforces.com/problemset/problem/1574/B | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18241
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1574-A | codeforces | 1574-A | Regular Bracket Sequences | https://codeforces.com/problemset/problem/1574/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23097
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1573-B | codeforces | 1573-B | Swaps | https://codeforces.com/problemset/problem/1573/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15595
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1573-A | codeforces | 1573-A | Countdown | https://codeforces.com/problemset/problem/1573/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21971
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1572-F | codeforces | 1572-F | Stations | https://codeforces.com/problemset/problem/1572/F | [
"data structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1572-E | codeforces | 1572-E | Polygon | https://codeforces.com/problemset/problem/1572/E | [
"binary search",
"dp",
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 374
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1572-D | codeforces | 1572-D | Bridge Club | https://codeforces.com/problemset/problem/1572/D | [
"flows",
"graph matchings",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 626
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1572-C | codeforces | 1572-C | Paint | https://codeforces.com/problemset/problem/1572/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1732
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1572-B | codeforces | 1572-B | Xor of 3 | https://codeforces.com/problemset/problem/1572/B | [
"brute force",
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2014
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1572-A | codeforces | 1572-A | Book | https://codeforces.com/problemset/problem/1572/A | [
"binary search",
"brute force",
"data structures",
"dp",
"graphs",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10474
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1571-J | codeforces | 1571-J | Two Railroads | https://codeforces.com/problemset/problem/1571/J | [
"*special"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 50
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1571-I | codeforces | 1571-I | Physical Examination | https://codeforces.com/problemset/problem/1571/I | [
"*special",
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 65
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1571-H | codeforces | 1571-H | Laser Beams | https://codeforces.com/problemset/problem/1571/H | [
"*special",
"geometry",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 56
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1571-G | codeforces | 1571-G | A Battle Against a Dragon | https://codeforces.com/problemset/problem/1571/G | [
"*special",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 85
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1571-F | codeforces | 1571-F | Kotlinforces | https://codeforces.com/problemset/problem/1571/F | [
"*special",
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 226
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1571-E | codeforces | 1571-E | Fix the String | https://codeforces.com/problemset/problem/1571/E | [
"*special",
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 374
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1571-D | codeforces | 1571-D | Sweepstake | https://codeforces.com/problemset/problem/1571/D | [
"*special",
"brute force",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 369
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1571-C | codeforces | 1571-C | Rhyme | https://codeforces.com/problemset/problem/1571/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 401
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1571-B | codeforces | 1571-B | Epic Novel | https://codeforces.com/problemset/problem/1571/B | [
"*special",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 760
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1571-A | codeforces | 1571-A | Sequence of Comparisons | https://codeforces.com/problemset/problem/1571/A | [
"*special"
] | null | null | stdin_stdout | 800 | {
"solved_count": 1643
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1569-F | codeforces | 1569-F | Palindromic Hamiltonian Path | https://codeforces.com/problemset/problem/1569/F | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"hashing"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 380
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1569-E | codeforces | 1569-E | Playoff Restoration | https://codeforces.com/problemset/problem/1569/E | [
"bitmasks",
"brute force",
"hashing",
"implementation",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 875
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1569-D | codeforces | 1569-D | Inconvenient Pairs | https://codeforces.com/problemset/problem/1569/D | [
"binary search",
"data structures",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4609
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1569-C | codeforces | 1569-C | Jury Meeting | https://codeforces.com/problemset/problem/1569/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1569-B | codeforces | 1569-B | Chess Tournament | https://codeforces.com/problemset/problem/1569/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19878
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1569-A | codeforces | 1569-A | Balanced Substring | https://codeforces.com/problemset/problem/1569/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26577
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1567-F | codeforces | 1567-F | One-Four Overload | https://codeforces.com/problemset/problem/1567/F | [
"2-sat",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 881
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1567-E | codeforces | 1567-E | Non-Decreasing Dilemma | https://codeforces.com/problemset/problem/1567/E | [
"data structures",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4152
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1567-D | codeforces | 1567-D | Expression Evaluation Error | https://codeforces.com/problemset/problem/1567/D | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4862
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1567-C | codeforces | 1567-C | Carrying Conundrum | https://codeforces.com/problemset/problem/1567/C | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13190
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1567-B | codeforces | 1567-B | MEXor Mixup | https://codeforces.com/problemset/problem/1567/B | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 33537
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1567-A | codeforces | 1567-A | Domino Disaster | https://codeforces.com/problemset/problem/1567/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31769
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1566-H | codeforces | 1566-H | Xor-quiz | https://codeforces.com/problemset/problem/1566/H | [
"constructive algorithms",
"dp",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 153
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1566-G | codeforces | 1566-G | Four Vertices | https://codeforces.com/problemset/problem/1566/G | [
"constructive algorithms",
"data structures",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 385
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1566-F | codeforces | 1566-F | Points Movement | https://codeforces.com/problemset/problem/1566/F | [
"data structures",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1179
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1566-E | codeforces | 1566-E | Buds Re-hanging | https://codeforces.com/problemset/problem/1566/E | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4455
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1566-D2 | codeforces | 1566-D2 | Seating Arrangements (hard version) | https://codeforces.com/problemset/problem/1566/D2 | [
"data structures",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8344
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1566-D1 | codeforces | 1566-D1 | Seating Arrangements (easy version) | https://codeforces.com/problemset/problem/1566/D1 | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14731
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1566-C | codeforces | 1566-C | MAX-MEX Cut | https://codeforces.com/problemset/problem/1566/C | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19090
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1566-B | codeforces | 1566-B | MIN-MEX Cut | https://codeforces.com/problemset/problem/1566/B | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21278
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1566-A | codeforces | 1566-A | Median Maximization | https://codeforces.com/problemset/problem/1566/A | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25415
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1562-F | codeforces | 1562-F | Tubular Bells | https://codeforces.com/problemset/problem/1562/F | [
"interactive",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 459
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1562-E | codeforces | 1562-E | Rescue Niwen! | https://codeforces.com/problemset/problem/1562/E | [
"dp",
"greedy",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1591
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1562-D2 | codeforces | 1562-D2 | Two Hundred Twenty One (hard version) | https://codeforces.com/problemset/problem/1562/D2 | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2250
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1562-D1 | codeforces | 1562-D1 | Two Hundred Twenty One (easy version) | https://codeforces.com/problemset/problem/1562/D1 | [
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6659
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1562-C | codeforces | 1562-C | Rings | https://codeforces.com/problemset/problem/1562/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14329
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1562-B | codeforces | 1562-B | Scenes From a Memory | https://codeforces.com/problemset/problem/1562/B | [
"brute force",
"constructive algorithms",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20588
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1562-A | codeforces | 1562-A | The Miracle and the Sleeper | https://codeforces.com/problemset/problem/1562/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26384
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1561-D1 | codeforces | 1561-D1 | Up the Strip (simplified version) | https://codeforces.com/problemset/problem/1561/D1 | [
"brute force",
"data structures",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6131
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1561-C | codeforces | 1561-C | Deep Down Below | https://codeforces.com/problemset/problem/1561/C | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21742
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1561-A | codeforces | 1561-A | Simply Strange Sort | https://codeforces.com/problemset/problem/1561/A | [
"brute force",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17178
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1560-F2 | codeforces | 1560-F2 | Nearest Beautiful Number (hard version) | https://codeforces.com/problemset/problem/1560/F2 | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4987
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1560-F1 | codeforces | 1560-F1 | Nearest Beautiful Number (easy version) | https://codeforces.com/problemset/problem/1560/F1 | [
"binary search",
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6771
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1560-E | codeforces | 1560-E | Polycarp and String Transformation | https://codeforces.com/problemset/problem/1560/E | [
"binary search",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8877
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1560-D | codeforces | 1560-D | Make a Power of Two | https://codeforces.com/problemset/problem/1560/D | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19503
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1560-C | codeforces | 1560-C | Infinity Table | https://codeforces.com/problemset/problem/1560/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28030
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1560-B | codeforces | 1560-B | Who's Opposite? | https://codeforces.com/problemset/problem/1560/B | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38930
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1560-A | codeforces | 1560-A | Dislike of Threes | https://codeforces.com/problemset/problem/1560/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 73902
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1559-E | codeforces | 1559-E | Mocha and Stars | https://codeforces.com/problemset/problem/1559/E | [
"combinatorics",
"dp",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2738
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1559-D2 | codeforces | 1559-D2 | Mocha and Diana (Hard Version) | https://codeforces.com/problemset/problem/1559/D2 | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3080
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1559-D1 | codeforces | 1559-D1 | Mocha and Diana (Easy Version) | https://codeforces.com/problemset/problem/1559/D1 | [
"brute force",
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16152
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1559-C | codeforces | 1559-C | Mocha and Hiking | https://codeforces.com/problemset/problem/1559/C | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22956
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1559-B | codeforces | 1559-B | Mocha and Red and Blue | https://codeforces.com/problemset/problem/1559/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24237
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1559-A | codeforces | 1559-A | Mocha and Math | https://codeforces.com/problemset/problem/1559/A | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 46375
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1558-F | codeforces | 1558-F | Strange Sort | https://codeforces.com/problemset/problem/1558/F | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 511
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1558-E | codeforces | 1558-E | Down Below | https://codeforces.com/problemset/problem/1558/E | [
"binary search",
"dfs and similar",
"graphs",
"greedy",
"meet-in-the-middle",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 704
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1558-D | codeforces | 1558-D | Top-Notch Insertions | https://codeforces.com/problemset/problem/1558/D | [
"combinatorics",
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1145
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1558-C | codeforces | 1558-C | Bottom-Tier Reversals | https://codeforces.com/problemset/problem/1558/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3742
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1558-B | codeforces | 1558-B | Up the Strip | https://codeforces.com/problemset/problem/1558/B | [
"brute force",
"dp",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5291
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1558-A | codeforces | 1558-A | Charmed by the Game | https://codeforces.com/problemset/problem/1558/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11502
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1557-E | codeforces | 1557-E | Assiut Chess | https://codeforces.com/problemset/problem/1557/E | [
"brute force",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 766
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1557-D | codeforces | 1557-D | Ezzat and Grid | https://codeforces.com/problemset/problem/1557/D | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3014
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1557-C | codeforces | 1557-C | Moamen and XOR | https://codeforces.com/problemset/problem/1557/C | [
"bitmasks",
"combinatorics",
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10587
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1557-B | codeforces | 1557-B | Moamen and k-subarrays | https://codeforces.com/problemset/problem/1557/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24646
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1557-A | codeforces | 1557-A | Ezzat and Two Subsequences | https://codeforces.com/problemset/problem/1557/A | [
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29179
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1556-H | codeforces | 1556-H | DIY Tree | https://codeforces.com/problemset/problem/1556/H | [
"graphs",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 446
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1556-G | codeforces | 1556-G | Gates to Another World | https://codeforces.com/problemset/problem/1556/G | [
"bitmasks",
"data structures",
"dsu",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 446
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1556-F | codeforces | 1556-F | Sports Betting | https://codeforces.com/problemset/problem/1556/F | [
"bitmasks",
"combinatorics",
"dp",
"graphs",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1423
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1556-E | codeforces | 1556-E | Equilibrium | https://codeforces.com/problemset/problem/1556/E | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3001
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1556-D | codeforces | 1556-D | Take a Guess | https://codeforces.com/problemset/problem/1556/D | [
"bitmasks",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8775
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1556-C | codeforces | 1556-C | Compressed Bracket Sequence | https://codeforces.com/problemset/problem/1556/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6231
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1556-B | codeforces | 1556-B | Take Your Places! | https://codeforces.com/problemset/problem/1556/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13293
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1556-A | codeforces | 1556-A | A Variety of Operations | https://codeforces.com/problemset/problem/1556/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18560
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1555-F | codeforces | 1555-F | Good Graph | https://codeforces.com/problemset/problem/1555/F | [
"data structures",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1058
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1555-E | codeforces | 1555-E | Boring Segments | https://codeforces.com/problemset/problem/1555/E | [
"data structures",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4556
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1555-D | codeforces | 1555-D | Say No to Palindromes | https://codeforces.com/problemset/problem/1555/D | [
"brute force",
"constructive algorithms",
"dp",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15649
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1555-C | codeforces | 1555-C | Coin Rows | https://codeforces.com/problemset/problem/1555/C | [
"brute force",
"constructive algorithms",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 24207
} | 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.