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: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": 4668
} | 2026-11-02T05:37:07.883505+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": 13653
} | 2026-11-02T05:37:07.883505+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": 20087
} | 2026-11-02T05:37:07.883505+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": 26774
} | 2026-11-02T05:37:07.883505+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": 904
} | 2026-11-02T05:37:07.883505+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": 4491
} | 2026-11-02T05:37:07.883505+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": 4999
} | 2026-11-02T05:37:07.883505+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": 13435
} | 2026-11-02T05:37:07.883505+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": 36581
} | 2026-11-02T05:37:07.883505+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": 32021
} | 2026-11-02T05:37:07.883505+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": 187
} | 2026-11-02T05:37:07.883505+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": 445
} | 2026-11-02T05:37:07.883505+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": 1293
} | 2026-11-02T05:37:07.883505+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": 4555
} | 2026-11-02T05:37:07.883505+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": 8410
} | 2026-11-02T05:37:07.883505+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": 14847
} | 2026-11-02T05:37:07.883505+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": 19346
} | 2026-11-02T05:37:07.883505+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": 21712
} | 2026-11-02T05:37:07.883505+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": 25758
} | 2026-11-02T05:37:07.883505+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": 484
} | 2026-11-02T05:37:07.883505+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": 1678
} | 2026-11-02T05:37:07.883505+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": 2316
} | 2026-11-02T05:37:07.883505+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": 6723
} | 2026-11-02T05:37:07.883505+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": 14490
} | 2026-11-02T05:37:07.883505+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": 20780
} | 2026-11-02T05:37:07.883505+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": 26515
} | 2026-11-02T05:37:07.883505+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": 6261
} | 2026-11-02T05:37:07.883505+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": 23877
} | 2026-11-02T05:37:07.883505+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": 17291
} | 2026-11-02T05:37:07.883505+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": 5168
} | 2026-11-02T05:37:07.883505+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": 6895
} | 2026-11-02T05:37:07.883505+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": 8984
} | 2026-11-02T05:37:07.883505+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": 19792
} | 2026-11-02T05:37:07.883505+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": 28247
} | 2026-11-02T05:37:07.883505+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": 39614
} | 2026-11-02T05:37:07.883505+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": 76735
} | 2026-11-02T05:37:07.883505+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": 2870
} | 2026-11-02T05:37:07.883505+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": 3310
} | 2026-11-02T05:37:07.883505+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": 16884
} | 2026-11-02T05:37:07.883505+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": 23467
} | 2026-11-02T05:37:07.883505+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": 24564
} | 2026-11-02T05:37:07.883505+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": 50705
} | 2026-11-02T05:37:07.883505+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": 619
} | 2026-11-02T05:37:07.883505+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": 780
} | 2026-11-02T05:37:07.883505+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": 1182
} | 2026-11-02T05:37:07.883505+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": 3848
} | 2026-11-02T05:37:07.883505+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": 5428
} | 2026-11-02T05:37:07.883505+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": 11555
} | 2026-11-02T05:37:07.883505+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": 805
} | 2026-11-02T05:37:07.883505+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": 3224
} | 2026-11-02T05:37:07.883505+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": 11187
} | 2026-11-02T05:37:07.883505+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": 25056
} | 2026-11-02T05:37:07.883505+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": 29427
} | 2026-11-02T05:37:07.883505+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": 641
} | 2026-11-02T05:37:07.883505+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": 485
} | 2026-11-02T05:37:07.883505+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": 1487
} | 2026-11-02T05:37:07.883505+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": 3125
} | 2026-11-02T05:37:07.883505+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": 9184
} | 2026-11-02T05:37:07.883505+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": 6298
} | 2026-11-02T05:37:07.883505+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": 13404
} | 2026-11-02T05:37:07.883505+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": 18669
} | 2026-11-02T05:37:07.883505+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": 1173
} | 2026-11-02T05:37:07.883505+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": 4904
} | 2026-11-02T05:37:07.883505+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": 16470
} | 2026-11-02T05:37:07.883505+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": 24766
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1555-B | codeforces | 1555-B | Two Tables | https://codeforces.com/problemset/problem/1555/B | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17531
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1555-A | codeforces | 1555-A | PizzaForces | https://codeforces.com/problemset/problem/1555/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30791
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1554-E | codeforces | 1554-E | You | https://codeforces.com/problemset/problem/1554/E | [
"dfs and similar",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1457
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1554-D | codeforces | 1554-D | Diane | https://codeforces.com/problemset/problem/1554/D | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10768
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1554-C | codeforces | 1554-C | Mikasa | https://codeforces.com/problemset/problem/1554/C | [
"binary search",
"bitmasks",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9993
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1554-B | codeforces | 1554-B | Cobb | https://codeforces.com/problemset/problem/1554/B | [
"bitmasks",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14086
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1554-A | codeforces | 1554-A | Cherry | https://codeforces.com/problemset/problem/1554/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31773
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1553-I | codeforces | 1553-I | Stairs | https://codeforces.com/problemset/problem/1553/I | [
"combinatorics",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 394
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1553-H | codeforces | 1553-H | XOR and Distance | https://codeforces.com/problemset/problem/1553/H | [
"bitmasks",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 941
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1553-G | codeforces | 1553-G | Common Divisor Graph | https://codeforces.com/problemset/problem/1553/G | [
"brute force",
"constructive algorithms",
"dsu",
"graphs",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1323
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1553-F | codeforces | 1553-F | Pairwise Modulo | https://codeforces.com/problemset/problem/1553/F | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2687
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1553-E | codeforces | 1553-E | Permutation Shift | https://codeforces.com/problemset/problem/1553/E | [
"brute force",
"combinatorics",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3882
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1553-D | codeforces | 1553-D | Backspace | https://codeforces.com/problemset/problem/1553/D | [
"dp",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15433
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1553-C | codeforces | 1553-C | Penalty | https://codeforces.com/problemset/problem/1553/C | [
"bitmasks",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20224
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1553-B | codeforces | 1553-B | Reverse String | https://codeforces.com/problemset/problem/1553/B | [
"brute force",
"dp",
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15685
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1553-A | codeforces | 1553-A | Digits Sum | https://codeforces.com/problemset/problem/1553/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34921
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1552-I | codeforces | 1552-I | Organizing a Music Festival | https://codeforces.com/problemset/problem/1552/I | [
"dfs and similar",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 155
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1552-H | codeforces | 1552-H | Guess the Perimeter | https://codeforces.com/problemset/problem/1552/H | [
"binary search",
"interactive",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 473
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1552-G | codeforces | 1552-G | A Serious Referee | https://codeforces.com/problemset/problem/1552/G | [
"bitmasks",
"brute force",
"dfs and similar",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 708
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1552-F | codeforces | 1552-F | Telepanting | https://codeforces.com/problemset/problem/1552/F | [
"binary search",
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3465
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1552-E | codeforces | 1552-E | Colors and Intervals | https://codeforces.com/problemset/problem/1552/E | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2173
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1552-D | codeforces | 1552-D | Array Differentiation | https://codeforces.com/problemset/problem/1552/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8059
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1552-C | codeforces | 1552-C | Maximize the Intersections | https://codeforces.com/problemset/problem/1552/C | [
"combinatorics",
"constructive algorithms",
"geometry",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6372
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1552-B | codeforces | 1552-B | Running for Gold | https://codeforces.com/problemset/problem/1552/B | [
"combinatorics",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17287
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1552-A | codeforces | 1552-A | Subsequence Permutation | https://codeforces.com/problemset/problem/1552/A | [
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25645
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1551-F | codeforces | 1551-F | Equidistant Vertices | https://codeforces.com/problemset/problem/1551/F | [
"brute force",
"combinatorics",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2277
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1551-E | codeforces | 1551-E | Fixed Points | https://codeforces.com/problemset/problem/1551/E | [
"binary search",
"brute force",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4696
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1551-D2 | codeforces | 1551-D2 | Domino (hard version) | https://codeforces.com/problemset/problem/1551/D2 | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3069
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1551-D1 | codeforces | 1551-D1 | Domino (easy version) | https://codeforces.com/problemset/problem/1551/D1 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7708
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1551-C | codeforces | 1551-C | Interesting Story | https://codeforces.com/problemset/problem/1551/C | [
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14813
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1551-B2 | codeforces | 1551-B2 | Wonderful Coloring - 2 | https://codeforces.com/problemset/problem/1551/B2 | [
"binary search",
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16936
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1551-B1 | codeforces | 1551-B1 | Wonderful Coloring - 1 | https://codeforces.com/problemset/problem/1551/B1 | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31822
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1551-A | codeforces | 1551-A | Polycarp and Coins | https://codeforces.com/problemset/problem/1551/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 59980
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1550-F | codeforces | 1550-F | Jumping Around | https://codeforces.com/problemset/problem/1550/F | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"dsu",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 998
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1550-E | codeforces | 1550-E | Stringforces | https://codeforces.com/problemset/problem/1550/E | [
"binary search",
"bitmasks",
"brute force",
"dp",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1978
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.