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: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": 30394
} | 2026-06-01T05:00:40.145500+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": 42956
} | 2026-06-01T05:00:40.145500+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": 41091
} | 2026-06-01T05:00:40.145500+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": 1104
} | 2026-06-01T05:00:40.145500+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": 2739
} | 2026-06-01T05:00:40.145500+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": 5078
} | 2026-06-01T05:00:40.145500+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": 16182
} | 2026-06-01T05:00:40.145500+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": 25391
} | 2026-06-01T05:00:40.145500+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": 20789
} | 2026-06-01T05:00:40.145500+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": 607
} | 2026-06-01T05:00:40.145500+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": 3075
} | 2026-06-01T05:00:40.145500+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": 8522
} | 2026-06-01T05:00:40.145500+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": 17775
} | 2026-06-01T05:00:40.145500+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": 34294
} | 2026-06-01T05:00:40.145500+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": 57403
} | 2026-06-01T05:00:40.145500+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": 264
} | 2026-06-01T05:00:40.145500+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": 876
} | 2026-06-01T05:00:40.145500+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": 710
} | 2026-06-01T05:00:40.145500+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": 1406
} | 2026-06-01T05:00:40.145500+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": 2079
} | 2026-06-01T05:00:40.145500+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": 6830
} | 2026-06-01T05:00:40.145500+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": 13884
} | 2026-06-01T05:00:40.145500+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": 12903
} | 2026-06-01T05:00:40.145500+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": 13181
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1533-J | codeforces | 1533-J | Pawns | https://codeforces.com/problemset/problem/1533/J | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 52
} | 2026-06-01T05:00:40.145500+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": 61
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 514
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 816
} | 2026-06-01T05:00:40.145500+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": 1130
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+00:00 |
codeforces:1532-E | codeforces | 1532-E | Good Array | https://codeforces.com/problemset/problem/1532/E | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 393
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1532-D | codeforces | 1532-D | Teams Forming | https://codeforces.com/problemset/problem/1532/D | [
"*special",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 591
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1532-C | codeforces | 1532-C | Uniform String | https://codeforces.com/problemset/problem/1532/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 642
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1532-B | codeforces | 1532-B | Frog Jumping | https://codeforces.com/problemset/problem/1532/B | [
"*special",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 830
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1532-A | codeforces | 1532-A | A+B (Trial Problem) | https://codeforces.com/problemset/problem/1532/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1151
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1531-E3 | codeforces | 1531-E3 | Сортировка слиянием | https://codeforces.com/problemset/problem/1531/E3 | [
"*special",
"binary search"
] | null | null | stdin_stdout | null | {
"solved_count": 271
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1531-E2 | codeforces | 1531-E2 | Сортировка слиянием | https://codeforces.com/problemset/problem/1531/E2 | [
"*special",
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 340
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1531-E1 | codeforces | 1531-E1 | Сортировка слиянием | https://codeforces.com/problemset/problem/1531/E1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1531-D | codeforces | 1531-D | Редактируем Зингер | color | https://codeforces.com/problemset/problem/1531/D | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 370
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1531-C | codeforces | 1531-C | Симметричный амфитеатр | https://codeforces.com/problemset/problem/1531/C | [
"*special",
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 659
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1531-B2 | codeforces | 1531-B2 | Мониторинг | https://codeforces.com/problemset/problem/1531/B2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 796
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1531-B1 | codeforces | 1531-B1 | Мониторинг | https://codeforces.com/problemset/problem/1531/B1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1531-A | codeforces | 1531-A | Зингер | color | https://codeforces.com/problemset/problem/1531/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 1485
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1530-H | codeforces | 1530-H | Turing's Award | https://codeforces.com/problemset/problem/1530/H | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 204
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1530-G | codeforces | 1530-G | What a Reversal | https://codeforces.com/problemset/problem/1530/G | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 185
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1530-F | codeforces | 1530-F | Bingo | https://codeforces.com/problemset/problem/1530/F | [
"bitmasks",
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1000
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1530-E | codeforces | 1530-E | Minimax | https://codeforces.com/problemset/problem/1530/E | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1530-D | codeforces | 1530-D | Secret Santa | https://codeforces.com/problemset/problem/1530/D | [
"constructive algorithms",
"flows",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10121
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1530-C | codeforces | 1530-C | Pursuit | https://codeforces.com/problemset/problem/1530/C | [
"binary search",
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15608
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1530-B | codeforces | 1530-B | Putting Plates | https://codeforces.com/problemset/problem/1530/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16296
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1530-A | codeforces | 1530-A | Binary Decimal | https://codeforces.com/problemset/problem/1530/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21955
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1529-B | codeforces | 1529-B | Sifid and Strange Subsequences | https://codeforces.com/problemset/problem/1529/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21238
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1529-A | codeforces | 1529-A | Eshag Loves Big Arrays | https://codeforces.com/problemset/problem/1529/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31061
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1528-F | codeforces | 1528-F | AmShZ Farm | https://codeforces.com/problemset/problem/1528/F | [
"combinatorics",
"fft",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 342
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1528-E | codeforces | 1528-E | Mashtali and Hagh Trees | https://codeforces.com/problemset/problem/1528/E | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 601
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1528-D | codeforces | 1528-D | It's a bird! No, it's a plane! No, it's AaParsa! | https://codeforces.com/problemset/problem/1528/D | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1706
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1528-C | codeforces | 1528-C | Trees of Tranquillity | https://codeforces.com/problemset/problem/1528/C | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2979
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1528-B | codeforces | 1528-B | Kavi on Pairing Duty | https://codeforces.com/problemset/problem/1528/B | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10731
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1528-A | codeforces | 1528-A | Parsa's Humongous Tree | https://codeforces.com/problemset/problem/1528/A | [
"dfs and similar",
"divide and conquer",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 19214
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1527-E | codeforces | 1527-E | Partition Game | https://codeforces.com/problemset/problem/1527/E | [
"binary search",
"data structures",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2934
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1527-D | codeforces | 1527-D | MEX Tree | https://codeforces.com/problemset/problem/1527/D | [
"combinatorics",
"dfs and similar",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2292
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1527-C | codeforces | 1527-C | Sequence Pair Weight | https://codeforces.com/problemset/problem/1527/C | [
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15064
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1527-B2 | codeforces | 1527-B2 | Palindrome Game (hard version) | https://codeforces.com/problemset/problem/1527/B2 | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8738
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1527-B1 | codeforces | 1527-B1 | Palindrome Game (easy version) | https://codeforces.com/problemset/problem/1527/B1 | [
"constructive algorithms",
"games"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 34868
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1527-A | codeforces | 1527-A | And Then There Were K | https://codeforces.com/problemset/problem/1527/A | [
"bitmasks"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42129
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1526-F | codeforces | 1526-F | Median Queries | https://codeforces.com/problemset/problem/1526/F | [
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 393
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1526-E | codeforces | 1526-E | Oolimry and Suffix Array | https://codeforces.com/problemset/problem/1526/E | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1437
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1526-D | codeforces | 1526-D | Kill Anton | https://codeforces.com/problemset/problem/1526/D | [
"brute force",
"constructive algorithms",
"data structures",
"math",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2805
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1526-C2 | codeforces | 1526-C2 | Potions (Hard Version) | https://codeforces.com/problemset/problem/1526/C2 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 30718
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1526-C1 | codeforces | 1526-C1 | Potions (Easy Version) | https://codeforces.com/problemset/problem/1526/C1 | [
"brute force",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 27371
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1526-B | codeforces | 1526-B | I Hate 1111 | https://codeforces.com/problemset/problem/1526/B | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 36967
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1526-A | codeforces | 1526-A | Mean Inequality | https://codeforces.com/problemset/problem/1526/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25047
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1525-F | codeforces | 1525-F | Goblins And Gnomes | https://codeforces.com/problemset/problem/1525/F | [
"brute force",
"dp",
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 402
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1525-E | codeforces | 1525-E | Assimilation IV | https://codeforces.com/problemset/problem/1525/E | [
"combinatorics",
"dp",
"math",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2457
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1525-D | codeforces | 1525-D | Armchairs | https://codeforces.com/problemset/problem/1525/D | [
"dp",
"flows",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10882
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1525-C | codeforces | 1525-C | Robot Collisions | https://codeforces.com/problemset/problem/1525/C | [
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4825
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1525-B | codeforces | 1525-B | Permutation Sort | https://codeforces.com/problemset/problem/1525/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26696
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1525-A | codeforces | 1525-A | Potion-making | https://codeforces.com/problemset/problem/1525/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27036
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1523-H | codeforces | 1523-H | Hopping Around the Array | https://codeforces.com/problemset/problem/1523/H | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 445
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1523-G | codeforces | 1523-G | Try Booking | https://codeforces.com/problemset/problem/1523/G | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 525
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1523-F | codeforces | 1523-F | Favorite Game | https://codeforces.com/problemset/problem/1523/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 485
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1523-E | codeforces | 1523-E | Crypto Lights | https://codeforces.com/problemset/problem/1523/E | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1946
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1523-D | codeforces | 1523-D | Love-Hate | https://codeforces.com/problemset/problem/1523/D | [
"bitmasks",
"brute force",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2489
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1523-C | codeforces | 1523-C | Compression and Expansion | https://codeforces.com/problemset/problem/1523/C | [
"brute force",
"data structures",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9194
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1523-B | codeforces | 1523-B | Lord of the Values | https://codeforces.com/problemset/problem/1523/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12521
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1523-A | codeforces | 1523-A | Game of Life | https://codeforces.com/problemset/problem/1523/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14069
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1521-E | codeforces | 1521-E | Nastia and a Beautiful Matrix | https://codeforces.com/problemset/problem/1521/E | [
"binary search",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 735
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1521-D | codeforces | 1521-D | Nastia Plays with a Tree | https://codeforces.com/problemset/problem/1521/D | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dp",
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2313
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1521-C | codeforces | 1521-C | Nastia and a Hidden Permutation | https://codeforces.com/problemset/problem/1521/C | [
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4622
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1521-B | codeforces | 1521-B | Nastia and a Good Array | https://codeforces.com/problemset/problem/1521/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1521-A | codeforces | 1521-A | Nastia and Nearly Good Numbers | https://codeforces.com/problemset/problem/1521/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 42207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1520-G | codeforces | 1520-G | To Go Or Not To Go? | https://codeforces.com/problemset/problem/1520/G | [
"brute force",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4255
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1520-F2 | codeforces | 1520-F2 | Guess the K-th Zero (Hard version) | https://codeforces.com/problemset/problem/1520/F2 | [
"binary search",
"constructive algorithms",
"data structures",
"interactive"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1520-F1 | codeforces | 1520-F1 | Guess the K-th Zero (Easy version) | https://codeforces.com/problemset/problem/1520/F1 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14504
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1520-E | codeforces | 1520-E | Arranging The Sheep | https://codeforces.com/problemset/problem/1520/E | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 28952
} | 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.