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: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": 24683
} | 2026-08-10T02:20:32.917453+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": 43622
} | 2026-08-10T02:20:32.917453+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": 1075
} | 2026-08-10T02:20:32.917453+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": 1484
} | 2026-08-10T02:20:32.917453+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": 3032
} | 2026-08-10T02:20:32.917453+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": 16455
} | 2026-08-10T02:20:32.917453+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": 26948
} | 2026-08-10T02:20:32.917453+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": 52475
} | 2026-08-10T02:20:32.917453+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": 40478
} | 2026-08-10T02:20:32.917453+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": 30859
} | 2026-08-10T02:20:32.917453+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": 136
} | 2026-08-10T02:20:32.917453+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": 412
} | 2026-08-10T02:20:32.917453+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": 601
} | 2026-08-10T02:20:32.917453+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": 808
} | 2026-08-10T02:20:32.917453+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": 3077
} | 2026-08-10T02:20:32.917453+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": 15111
} | 2026-08-10T02:20:32.917453+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": 1089
} | 2026-08-10T02:20:32.917453+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": 1110
} | 2026-08-10T02:20:32.917453+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": 12890
} | 2026-08-10T02:20:32.917453+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": 33288
} | 2026-08-10T02:20:32.917453+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": 26970
} | 2026-08-10T02:20:32.917453+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": 21738
} | 2026-08-10T02:20:32.917453+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": 5421
} | 2026-08-10T02:20:32.917453+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": 22593
} | 2026-08-10T02:20:32.917453+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": 3278
} | 2026-08-10T02:20:32.917453+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": 15541
} | 2026-08-10T02:20:32.917453+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": 35800
} | 2026-08-10T02:20:32.917453+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": 33930
} | 2026-08-10T02:20:32.917453+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": 40920
} | 2026-08-10T02:20:32.917453+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": 2862
} | 2026-08-10T02:20:32.917453+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": 6373
} | 2026-08-10T02:20:32.917453+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": 16960
} | 2026-08-10T02:20:32.917453+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": 13869
} | 2026-08-10T02:20:32.917453+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": 30753
} | 2026-08-10T02:20:32.917453+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": 44847
} | 2026-08-10T02:20:32.917453+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": 41494
} | 2026-08-10T02:20:32.917453+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": 1203
} | 2026-08-10T02:20:32.917453+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": 2772
} | 2026-08-10T02:20:32.917453+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": 5184
} | 2026-08-10T02:20:32.917453+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": 16370
} | 2026-08-10T02:20:32.917453+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": 26418
} | 2026-08-10T02:20:32.917453+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": 20839
} | 2026-08-10T02:20:32.917453+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": 722
} | 2026-08-10T02:20:32.917453+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": 3147
} | 2026-08-10T02:20:32.917453+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": 8578
} | 2026-08-10T02:20:32.917453+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": 17984
} | 2026-08-10T02:20:32.917453+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": 34535
} | 2026-08-10T02:20:32.917453+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": 58169
} | 2026-08-10T02:20:32.917453+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": 418
} | 2026-08-10T02:20:32.917453+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": 1093
} | 2026-08-10T02:20:32.917453+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": 833
} | 2026-08-10T02:20:32.917453+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": 1477
} | 2026-08-10T02:20:32.917453+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": 2113
} | 2026-08-10T02:20:32.917453+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": 6970
} | 2026-08-10T02:20:32.917453+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": 14007
} | 2026-08-10T02:20:32.917453+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": 13017
} | 2026-08-10T02:20:32.917453+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": 13345
} | 2026-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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": 817
} | 2026-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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": 396
} | 2026-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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-08-10T02:20:32.917453+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": 272
} | 2026-08-10T02:20:32.917453+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": 341
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1531-E1 | codeforces | 1531-E1 | Сортировка слиянием | https://codeforces.com/problemset/problem/1531/E1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 363
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1531-D | codeforces | 1531-D | Редактируем Зингер | color | https://codeforces.com/problemset/problem/1531/D | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 371
} | 2026-08-10T02:20:32.917453+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": 660
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1531-B2 | codeforces | 1531-B2 | Мониторинг | https://codeforces.com/problemset/problem/1531/B2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 797
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1531-B1 | codeforces | 1531-B1 | Мониторинг | https://codeforces.com/problemset/problem/1531/B1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1158
} | 2026-08-10T02:20:32.917453+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": 1486
} | 2026-08-10T02:20:32.917453+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": 210
} | 2026-08-10T02:20:32.917453+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": 188
} | 2026-08-10T02:20:32.917453+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": 1183
} | 2026-08-10T02:20:32.917453+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": 3395
} | 2026-08-10T02:20:32.917453+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": 10238
} | 2026-08-10T02:20:32.917453+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": 15704
} | 2026-08-10T02:20:32.917453+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": 16337
} | 2026-08-10T02:20:32.917453+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": 22046
} | 2026-08-10T02:20:32.917453+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": 21292
} | 2026-08-10T02:20:32.917453+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": 31138
} | 2026-08-10T02:20:32.917453+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": 556
} | 2026-08-10T02:20:32.917453+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": 647
} | 2026-08-10T02:20:32.917453+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": 1791
} | 2026-08-10T02:20:32.917453+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": 3039
} | 2026-08-10T02:20:32.917453+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": 10987
} | 2026-08-10T02:20:32.917453+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": 19903
} | 2026-08-10T02:20:32.917453+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": 3075
} | 2026-08-10T02:20:32.917453+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": 2341
} | 2026-08-10T02:20:32.917453+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": 15277
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.