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:1550-D | codeforces | 1550-D | Excellent Arrays | https://codeforces.com/problemset/problem/1550/D | [
"binary search",
"combinatorics",
"constructive algorithms",
"implementation",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2123
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1550-C | codeforces | 1550-C | Manhattan Subarrays | https://codeforces.com/problemset/problem/1550/C | [
"brute force",
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11018
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1550-B | codeforces | 1550-B | Maximum Cost Deletion | https://codeforces.com/problemset/problem/1550/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28970
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1550-A | codeforces | 1550-A | Find The Array | https://codeforces.com/problemset/problem/1550/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29771
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1549-B | codeforces | 1549-B | Gregor and the Pawn Game | https://codeforces.com/problemset/problem/1549/B | [
"dfs and similar",
"dp",
"flows",
"graph matchings",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27616
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1549-A | codeforces | 1549-A | Gregor and Cryptography | https://codeforces.com/problemset/problem/1549/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36258
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1548-E | codeforces | 1548-E | Gregor and the Two Painters | https://codeforces.com/problemset/problem/1548/E | [
"data structures",
"divide and conquer",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 667
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1548-D2 | codeforces | 1548-D2 | Gregor and the Odd Cows (Hard) | https://codeforces.com/problemset/problem/1548/D2 | [
"brute force",
"geometry",
"math",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 359
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1548-D1 | codeforces | 1548-D1 | Gregor and the Odd Cows (Easy) | https://codeforces.com/problemset/problem/1548/D1 | [
"bitmasks",
"geometry",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1653
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1548-C | codeforces | 1548-C | The Three Little Pigs | https://codeforces.com/problemset/problem/1548/C | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2314
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1548-B | codeforces | 1548-B | Integers Have Friends | https://codeforces.com/problemset/problem/1548/B | [
"binary search",
"data structures",
"divide and conquer",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11928
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1548-A | codeforces | 1548-A | Web of Lies | https://codeforces.com/problemset/problem/1548/A | [
"brute force",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18039
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1547-G | codeforces | 1547-G | How Many Paths? | https://codeforces.com/problemset/problem/1547/G | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3838
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1547-F | codeforces | 1547-F | Array Stabilization (GCD version) | https://codeforces.com/problemset/problem/1547/F | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7481
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1547-E | codeforces | 1547-E | Air Conditioners | https://codeforces.com/problemset/problem/1547/E | [
"data structures",
"dp",
"implementation",
"shortest paths",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16926
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1547-D | codeforces | 1547-D | Co-growing Sequence | https://codeforces.com/problemset/problem/1547/D | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19119
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1547-C | codeforces | 1547-C | Pair Programming | https://codeforces.com/problemset/problem/1547/C | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24908
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1547-B | codeforces | 1547-B | Alphabetical Strings | https://codeforces.com/problemset/problem/1547/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28287
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1547-A | codeforces | 1547-A | Shortest Path with Obstacle | https://codeforces.com/problemset/problem/1547/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32766
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1546-B | codeforces | 1546-B | AquaMoon and Stolen String | https://codeforces.com/problemset/problem/1546/B | [
"interactive",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14178
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1546-A | codeforces | 1546-A | AquaMoon and Two Arrays | https://codeforces.com/problemset/problem/1546/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18677
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1545-F | codeforces | 1545-F | AquaMoon and Potatoes | https://codeforces.com/problemset/problem/1545/F | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 152
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1545-E2 | codeforces | 1545-E2 | AquaMoon and Time Stop (hard version) | https://codeforces.com/problemset/problem/1545/E2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 110
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1545-E1 | codeforces | 1545-E1 | AquaMoon and Time Stop (easy version) | https://codeforces.com/problemset/problem/1545/E1 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 110
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1545-D | codeforces | 1545-D | AquaMoon and Wrong Coordinate | https://codeforces.com/problemset/problem/1545/D | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 820
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1545-C | codeforces | 1545-C | AquaMoon and Permutations | https://codeforces.com/problemset/problem/1545/C | [
"2-sat",
"brute force",
"combinatorics",
"constructive algorithms",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 847
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1545-B | codeforces | 1545-B | AquaMoon and Chess | https://codeforces.com/problemset/problem/1545/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7249
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1545-A | codeforces | 1545-A | AquaMoon and Strange Sort | https://codeforces.com/problemset/problem/1545/A | [
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15093
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1543-E | codeforces | 1543-E | The Final Pursuit | https://codeforces.com/problemset/problem/1543/E | [
"bitmasks",
"constructive algorithms",
"divide and conquer",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 521
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1543-D2 | codeforces | 1543-D2 | RPD and Rap Sheet (Hard Version) | https://codeforces.com/problemset/problem/1543/D2 | [
"brute force",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2224
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1543-D1 | codeforces | 1543-D1 | RPD and Rap Sheet (Easy Version) | https://codeforces.com/problemset/problem/1543/D1 | [
"bitmasks",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8105
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1543-C | codeforces | 1543-C | Need for Pink Slips | https://codeforces.com/problemset/problem/1543/C | [
"bitmasks",
"brute force",
"dfs and similar",
"implementation",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5735
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1543-B | codeforces | 1543-B | Customising the Track | https://codeforces.com/problemset/problem/1543/B | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24813
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1543-A | codeforces | 1543-A | Exciting Bets | https://codeforces.com/problemset/problem/1543/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 45568
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1542-E2 | codeforces | 1542-E2 | Abnormal Permutation Pairs (hard version) | https://codeforces.com/problemset/problem/1542/E2 | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1122
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1542-E1 | codeforces | 1542-E1 | Abnormal Permutation Pairs (easy version) | https://codeforces.com/problemset/problem/1542/E1 | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1521
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1542-D | codeforces | 1542-D | Priority Queue | https://codeforces.com/problemset/problem/1542/D | [
"combinatorics",
"dp",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3070
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1542-C | codeforces | 1542-C | Strange Function | https://codeforces.com/problemset/problem/1542/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16670
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1542-B | codeforces | 1542-B | Plus and Multiply | https://codeforces.com/problemset/problem/1542/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 27380
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1542-A | codeforces | 1542-A | Odd Set | https://codeforces.com/problemset/problem/1542/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 53166
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1541-B | codeforces | 1541-B | Pleasant Pairs | https://codeforces.com/problemset/problem/1541/B | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 41806
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1541-A | codeforces | 1541-A | Pretty Permutations | https://codeforces.com/problemset/problem/1541/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30990
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1540-E | codeforces | 1540-E | Tasty Dishes | https://codeforces.com/problemset/problem/1540/E | [
"math",
"matrices"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 139
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1540-D | codeforces | 1540-D | Inverse Inversions | https://codeforces.com/problemset/problem/1540/D | [
"binary search",
"brute force",
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 417
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1540-C2 | codeforces | 1540-C2 | Converging Array (Hard Version) | https://codeforces.com/problemset/problem/1540/C2 | [
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 620
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1540-C1 | codeforces | 1540-C1 | Converging Array (Easy Version) | https://codeforces.com/problemset/problem/1540/C1 | [
"dp",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 835
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1540-B | codeforces | 1540-B | Tree Array | https://codeforces.com/problemset/problem/1540/B | [
"brute force",
"combinatorics",
"dp",
"graphs",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3154
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1540-A | codeforces | 1540-A | Great Graphs | https://codeforces.com/problemset/problem/1540/A | [
"constructive algorithms",
"graphs",
"greedy",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15209
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1539-F | codeforces | 1539-F | Strange Array | https://codeforces.com/problemset/problem/1539/F | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1098
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1539-E | codeforces | 1539-E | Game with Cards | https://codeforces.com/problemset/problem/1539/E | [
"binary search",
"constructive algorithms",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1124
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1539-D | codeforces | 1539-D | PriceFixed | https://codeforces.com/problemset/problem/1539/D | [
"binary search",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13014
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1539-C | codeforces | 1539-C | Stable Groups | https://codeforces.com/problemset/problem/1539/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 34520
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1539-B | codeforces | 1539-B | Love Song | https://codeforces.com/problemset/problem/1539/B | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27186
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1539-A | codeforces | 1539-A | Contest Start | https://codeforces.com/problemset/problem/1539/A | [
"combinatorics",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21936
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1538-G | codeforces | 1538-G | Gift Set | https://codeforces.com/problemset/problem/1538/G | [
"binary search",
"greedy",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5496
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1538-F | codeforces | 1538-F | Interesting Function | https://codeforces.com/problemset/problem/1538/F | [
"binary search",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 22958
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1538-E | codeforces | 1538-E | Funny Substrings | https://codeforces.com/problemset/problem/1538/E | [
"data structures",
"hashing",
"implementation",
"matrices",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3317
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1538-D | codeforces | 1538-D | Another Problem About Dividing Numbers | https://codeforces.com/problemset/problem/1538/D | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 15810
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1538-C | codeforces | 1538-C | Number of Pairs | https://codeforces.com/problemset/problem/1538/C | [
"binary search",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 37093
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1538-B | codeforces | 1538-B | Friends and Candies | https://codeforces.com/problemset/problem/1538/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34131
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1538-A | codeforces | 1538-A | Stone Game | https://codeforces.com/problemset/problem/1538/A | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41397
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1537-F | codeforces | 1537-F | Figure Fixing | https://codeforces.com/problemset/problem/1537/F | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2920
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1537-E2 | codeforces | 1537-E2 | Erase and Extend (Hard Version) | https://codeforces.com/problemset/problem/1537/E2 | [
"binary search",
"data structures",
"greedy",
"hashing",
"string suffix structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 6541
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1537-E1 | codeforces | 1537-E1 | Erase and Extend (Easy Version) | https://codeforces.com/problemset/problem/1537/E1 | [
"binary search",
"brute force",
"dp",
"greedy",
"hashing",
"implementation",
"string suffix structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 17420
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1537-D | codeforces | 1537-D | Deleting Divisors | https://codeforces.com/problemset/problem/1537/D | [
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14070
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1537-C | codeforces | 1537-C | Challenging Cliffs | https://codeforces.com/problemset/problem/1537/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 31110
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1537-B | codeforces | 1537-B | Bad Boy | https://codeforces.com/problemset/problem/1537/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 46815
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1537-A | codeforces | 1537-A | Arithmetic Array | https://codeforces.com/problemset/problem/1537/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41919
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1536-F | codeforces | 1536-F | Omkar and Akmar | https://codeforces.com/problemset/problem/1536/F | [
"chinese remainder theorem",
"combinatorics",
"constructive algorithms",
"fft",
"games",
"geometry",
"math",
"meet-in-the-middle",
"string suffix structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1255
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1536-E | codeforces | 1536-E | Omkar and Forest | https://codeforces.com/problemset/problem/1536/E | [
"combinatorics",
"graphs",
"math",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2789
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1536-D | codeforces | 1536-D | Omkar and Medians | https://codeforces.com/problemset/problem/1536/D | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5218
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1536-C | codeforces | 1536-C | Diluc and Kaeya | https://codeforces.com/problemset/problem/1536/C | [
"data structures",
"dp",
"hashing",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16611
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1536-B | codeforces | 1536-B | Prinzessin der Verurteilung | https://codeforces.com/problemset/problem/1536/B | [
"brute force",
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 27320
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1536-A | codeforces | 1536-A | Omkar and Bad Story | https://codeforces.com/problemset/problem/1536/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20952
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1535-F | codeforces | 1535-F | String Distance | https://codeforces.com/problemset/problem/1535/F | [
"binary search",
"brute force",
"data structures",
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 742
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1535-E | codeforces | 1535-E | Gold Transfer | https://codeforces.com/problemset/problem/1535/E | [
"binary search",
"data structures",
"dp",
"greedy",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3196
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1535-D | codeforces | 1535-D | Playoff Tournament | https://codeforces.com/problemset/problem/1535/D | [
"data structures",
"dfs and similar",
"dp",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8660
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1535-C | codeforces | 1535-C | Unstable String | https://codeforces.com/problemset/problem/1535/C | [
"binary search",
"dp",
"greedy",
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18175
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1535-B | codeforces | 1535-B | Array Reodering | https://codeforces.com/problemset/problem/1535/B | [
"brute force",
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 34813
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1535-A | codeforces | 1535-A | Fair Playoff | https://codeforces.com/problemset/problem/1535/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 58999
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1534-H | codeforces | 1534-H | Lost Nodes | https://codeforces.com/problemset/problem/1534/H | [
"constructive algorithms",
"dp",
"graphs",
"interactive",
"sortings",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 424
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1534-G | codeforces | 1534-G | A New Beginning | https://codeforces.com/problemset/problem/1534/G | [
"data structures",
"dp",
"geometry",
"sortings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 1119
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1534-F2 | codeforces | 1534-F2 | Falling Sand (Hard Version) | https://codeforces.com/problemset/problem/1534/F2 | [
"dfs and similar",
"dp",
"graphs",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 853
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1534-F1 | codeforces | 1534-F1 | Falling Sand (Easy Version) | https://codeforces.com/problemset/problem/1534/F1 | [
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1503
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1534-E | codeforces | 1534-E | Lost Array | https://codeforces.com/problemset/problem/1534/E | [
"graphs",
"greedy",
"interactive",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2129
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1534-D | codeforces | 1534-D | Lost Tree | https://codeforces.com/problemset/problem/1534/D | [
"constructive algorithms",
"interactive",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7064
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1534-C | codeforces | 1534-C | Little Alawn's Puzzle | https://codeforces.com/problemset/problem/1534/C | [
"combinatorics",
"dp",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14128
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1534-B | codeforces | 1534-B | Histogram Ugliness | https://codeforces.com/problemset/problem/1534/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13056
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1534-A | codeforces | 1534-A | Colour the Flag | https://codeforces.com/problemset/problem/1534/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13407
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1533-J | codeforces | 1533-J | Pawns | https://codeforces.com/problemset/problem/1533/J | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 53
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1533-I | codeforces | 1533-I | Excursions | https://codeforces.com/problemset/problem/1533/I | [
"*special",
"constructive algorithms",
"dfs and similar",
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | null | {
"solved_count": 63
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1533-H | codeforces | 1533-H | Submatrices | https://codeforces.com/problemset/problem/1533/H | [
"*special",
"bitmasks",
"data structures",
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 92
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1533-G | codeforces | 1533-G | Biome Map | https://codeforces.com/problemset/problem/1533/G | [
"*special",
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | null | {
"solved_count": 98
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1533-F | codeforces | 1533-F | Binary String Partition | https://codeforces.com/problemset/problem/1533/F | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 224
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1533-E | codeforces | 1533-E | Chess Team Forming | https://codeforces.com/problemset/problem/1533/E | [
"*special",
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 285
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1533-D | codeforces | 1533-D | String Searching | https://codeforces.com/problemset/problem/1533/D | [
"*special",
"hashing"
] | null | null | stdin_stdout | null | {
"solved_count": 516
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1533-C | codeforces | 1533-C | Sweets | https://codeforces.com/problemset/problem/1533/C | [
"*special",
"data structures",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 484
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1533-B | codeforces | 1533-B | Nearest Point Function | https://codeforces.com/problemset/problem/1533/B | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 818
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1533-A | codeforces | 1533-A | Travel to Bertown | https://codeforces.com/problemset/problem/1533/A | [
"*special",
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 1133
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1532-F | codeforces | 1532-F | Prefixes and Suffixes | https://codeforces.com/problemset/problem/1532/F | [
"*special",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 220
} | 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.