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:2052-A | codeforces | 2052-A | Adrenaline Rush | https://codeforces.com/problemset/problem/2052/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4559
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2051-G | codeforces | 2051-G | Snakes | https://codeforces.com/problemset/problem/2051/G | [
"bitmasks",
"dp",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2566
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2051-F | codeforces | 2051-F | Joker | https://codeforces.com/problemset/problem/2051/F | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4188
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2051-E | codeforces | 2051-E | Best Price | https://codeforces.com/problemset/problem/2051/E | [
"binary search",
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12574
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2051-D | codeforces | 2051-D | Counting Pairs | https://codeforces.com/problemset/problem/2051/D | [
"binary search",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25207
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2051-C | codeforces | 2051-C | Preparing for the Exam | https://codeforces.com/problemset/problem/2051/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28886
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2051-B | codeforces | 2051-B | Journey | https://codeforces.com/problemset/problem/2051/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41323
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2051-A | codeforces | 2051-A | Preparing for the Olympiad | https://codeforces.com/problemset/problem/2051/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35917
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2050-G | codeforces | 2050-G | Tree Destruction | https://codeforces.com/problemset/problem/2050/G | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5725
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2050-F | codeforces | 2050-F | Maximum modulo equality | https://codeforces.com/problemset/problem/2050/F | [
"data structures",
"divide and conquer",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11935
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2050-E | codeforces | 2050-E | Three Strings | https://codeforces.com/problemset/problem/2050/E | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15420
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2050-D | codeforces | 2050-D | Digital string maximization | https://codeforces.com/problemset/problem/2050/D | [
"brute force",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19801
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2050-C | codeforces | 2050-C | Uninteresting Number | https://codeforces.com/problemset/problem/2050/C | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 26152
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2050-B | codeforces | 2050-B | Transfusion | https://codeforces.com/problemset/problem/2050/B | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28110
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2050-A | codeforces | 2050-A | Line Breaks | https://codeforces.com/problemset/problem/2050/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37280
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2049-F | codeforces | 2049-F | MEX OR Mania | https://codeforces.com/problemset/problem/2049/F | [
"bitmasks",
"brute force",
"data structures",
"dsu",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 616
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2049-E | codeforces | 2049-E | Broken Queries | https://codeforces.com/problemset/problem/2049/E | [
"binary search",
"bitmasks",
"brute force",
"constructive algorithms",
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1668
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2049-D | codeforces | 2049-D | Shift + Esc | https://codeforces.com/problemset/problem/2049/D | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6296
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2049-C | codeforces | 2049-C | MEX Cycle | https://codeforces.com/problemset/problem/2049/C | [
"brute force",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14152
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2049-B | codeforces | 2049-B | pspspsps | https://codeforces.com/problemset/problem/2049/B | [
"brute force",
"constructive algorithms",
"graph matchings",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19473
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2049-A | codeforces | 2049-A | MEX Destruction | https://codeforces.com/problemset/problem/2049/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24486
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2048-I2 | codeforces | 2048-I2 | Kevin and Puzzle (Hard Version) | https://codeforces.com/problemset/problem/2048/I2 | [
"bitmasks",
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 85
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2048-I1 | codeforces | 2048-I1 | Kevin and Puzzle (Easy Version) | https://codeforces.com/problemset/problem/2048/I1 | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 113
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2048-H | codeforces | 2048-H | Kevin and Strange Operation | https://codeforces.com/problemset/problem/2048/H | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 288
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2048-G | codeforces | 2048-G | Kevin and Matrices | https://codeforces.com/problemset/problem/2048/G | [
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 808
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2048-F | codeforces | 2048-F | Kevin and Math Class | https://codeforces.com/problemset/problem/2048/F | [
"brute force",
"data structures",
"divide and conquer",
"dp",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1384
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2048-E | codeforces | 2048-E | Kevin and Bipartite Graph | https://codeforces.com/problemset/problem/2048/E | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3643
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2048-D | codeforces | 2048-D | Kevin and Competition Memories | https://codeforces.com/problemset/problem/2048/D | [
"binary search",
"brute force",
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8662
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2048-C | codeforces | 2048-C | Kevin and Binary Strings | https://codeforces.com/problemset/problem/2048/C | [
"bitmasks",
"brute force",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15630
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2048-B | codeforces | 2048-B | Kevin and Permutation | https://codeforces.com/problemset/problem/2048/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21174
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2048-A | codeforces | 2048-A | Kevin and Combination Lock | https://codeforces.com/problemset/problem/2048/A | [
"brute force",
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23161
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2047-B | codeforces | 2047-B | Replace Character | https://codeforces.com/problemset/problem/2047/B | [
"brute force",
"combinatorics",
"greedy",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19979
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2047-A | codeforces | 2047-A | Alyona and a Square Jigsaw Puzzle | https://codeforces.com/problemset/problem/2047/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18173
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2046-F2 | codeforces | 2046-F2 | Yandex Cuneiform (Hard Version) | https://codeforces.com/problemset/problem/2046/F2 | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 113
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2046-F1 | codeforces | 2046-F1 | Yandex Cuneiform (Easy Version) | https://codeforces.com/problemset/problem/2046/F1 | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 146
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2046-E2 | codeforces | 2046-E2 | Cheops and a Contest (Hard Version) | https://codeforces.com/problemset/problem/2046/E2 | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 102
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2046-E1 | codeforces | 2046-E1 | Cheops and a Contest (Easy Version) | https://codeforces.com/problemset/problem/2046/E1 | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 242
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2046-D | codeforces | 2046-D | For the Emperor! | https://codeforces.com/problemset/problem/2046/D | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 579
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2046-C | codeforces | 2046-C | Adventurers | https://codeforces.com/problemset/problem/2046/C | [
"binary search",
"data structures",
"greedy",
"sortings",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2474
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2046-B | codeforces | 2046-B | Move Back at a Cost | https://codeforces.com/problemset/problem/2046/B | [
"binary search",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11482
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2046-A | codeforces | 2046-A | Swap Columns and Find a Path | https://codeforces.com/problemset/problem/2046/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17489
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-M | codeforces | 2045-M | Mirror Maze | https://codeforces.com/problemset/problem/2045/M | [
"brute force",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2427
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-L | codeforces | 2045-L | Buggy DFS | https://codeforces.com/problemset/problem/2045/L | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 343
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-K | codeforces | 2045-K | GCDDCG | https://codeforces.com/problemset/problem/2045/K | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 136
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-J | codeforces | 2045-J | Xorderable Array | https://codeforces.com/problemset/problem/2045/J | [
"bitmasks",
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 369
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-I | codeforces | 2045-I | Microwavable Subsequence | https://codeforces.com/problemset/problem/2045/I | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1501
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-H | codeforces | 2045-H | Missing Separators | https://codeforces.com/problemset/problem/2045/H | [
"dp",
"sortings",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 868
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-G | codeforces | 2045-G | X Aura | https://codeforces.com/problemset/problem/2045/G | [
"graphs",
"math",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1032
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-F | codeforces | 2045-F | Grid Game 3-angle | https://codeforces.com/problemset/problem/2045/F | [
"games",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 193
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-E | codeforces | 2045-E | Narrower Passageway | https://codeforces.com/problemset/problem/2045/E | [
"combinatorics",
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 408
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-D | codeforces | 2045-D | Aquatic Dragon | https://codeforces.com/problemset/problem/2045/D | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 86
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-C | codeforces | 2045-C | Saraga | https://codeforces.com/problemset/problem/2045/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7778
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-B | codeforces | 2045-B | ICPC Square | https://codeforces.com/problemset/problem/2045/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1885
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2045-A | codeforces | 2045-A | Scrambled Scrabble | https://codeforces.com/problemset/problem/2045/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2773
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2044-H | codeforces | 2044-H | Hard Demon Problem | https://codeforces.com/problemset/problem/2044/H | [
"constructive algorithms",
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2773
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2044-G2 | codeforces | 2044-G2 | Medium Demon Problem (hard version) | https://codeforces.com/problemset/problem/2044/G2 | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4156
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2044-G1 | codeforces | 2044-G1 | Medium Demon Problem (easy version) | https://codeforces.com/problemset/problem/2044/G1 | [
"dfs and similar",
"graph matchings",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7829
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2044-F | codeforces | 2044-F | Easy Demon Problem | https://codeforces.com/problemset/problem/2044/F | [
"binary search",
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6623
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2044-E | codeforces | 2044-E | Insane Problem | https://codeforces.com/problemset/problem/2044/E | [
"binary search",
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18862
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2044-D | codeforces | 2044-D | Harder Problem | https://codeforces.com/problemset/problem/2044/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24932
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2044-C | codeforces | 2044-C | Hard Problem | https://codeforces.com/problemset/problem/2044/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 46901
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2044-B | codeforces | 2044-B | Normal Problem | https://codeforces.com/problemset/problem/2044/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54420
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2044-A | codeforces | 2044-A | Easy Problem | https://codeforces.com/problemset/problem/2044/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 64769
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2043-G | codeforces | 2043-G | Problem with Queries | https://codeforces.com/problemset/problem/2043/G | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 360
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2043-F | codeforces | 2043-F | Nim | https://codeforces.com/problemset/problem/2043/F | [
"bitmasks",
"brute force",
"combinatorics",
"dp",
"games",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 938
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2043-E | codeforces | 2043-E | Matrix Transformation | https://codeforces.com/problemset/problem/2043/E | [
"bitmasks",
"brute force",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1897
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2043-D | codeforces | 2043-D | Problem about GCD | https://codeforces.com/problemset/problem/2043/D | [
"brute force",
"flows",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8064
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2043-C | codeforces | 2043-C | Sums on Segments | https://codeforces.com/problemset/problem/2043/C | [
"binary search",
"brute force",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11740
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2043-B | codeforces | 2043-B | Digits | https://codeforces.com/problemset/problem/2043/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22428
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2043-A | codeforces | 2043-A | Coin Transformation | https://codeforces.com/problemset/problem/2043/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27407
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2042-F | codeforces | 2042-F | Two Subarrays | https://codeforces.com/problemset/problem/2042/F | [
"data structures",
"dp",
"implementation",
"matrices"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 963
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2042-E | codeforces | 2042-E | Vertex Pairs | https://codeforces.com/problemset/problem/2042/E | [
"binary search",
"brute force",
"data structures",
"dfs and similar",
"divide and conquer",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 553
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2042-D | codeforces | 2042-D | Recommendations | https://codeforces.com/problemset/problem/2042/D | [
"data structures",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5694
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2042-C | codeforces | 2042-C | Competitive Fishing | https://codeforces.com/problemset/problem/2042/C | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9101
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2042-B | codeforces | 2042-B | Game with Colored Marbles | https://codeforces.com/problemset/problem/2042/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20086
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2042-A | codeforces | 2042-A | Greedy Monocarp | https://codeforces.com/problemset/problem/2042/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21204
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-N | codeforces | 2041-N | Railway Construction | https://codeforces.com/problemset/problem/2041/N | [] | null | null | stdin_stdout | 3,300 | {
"solved_count": 90
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-M | codeforces | 2041-M | Selection Sort | https://codeforces.com/problemset/problem/2041/M | [
"binary search",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1419
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-L | codeforces | 2041-L | Building Castle | https://codeforces.com/problemset/problem/2041/L | [] | null | null | stdin_stdout | 2,900 | {
"solved_count": 74
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-K | codeforces | 2041-K | Trophic Balance Species | https://codeforces.com/problemset/problem/2041/K | [
"binary search",
"brute force",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 126
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-J | codeforces | 2041-J | Bottle Arrangement | https://codeforces.com/problemset/problem/2041/J | [
"data structures",
"divide and conquer",
"dp",
"dsu",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 291
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-I | codeforces | 2041-I | Auto Complete | https://codeforces.com/problemset/problem/2041/I | [
"binary search",
"data structures",
"hashing",
"implementation",
"sortings",
"strings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 718
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-H | codeforces | 2041-H | Sheet Music | https://codeforces.com/problemset/problem/2041/H | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1090
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-G | codeforces | 2041-G | Grid Game | https://codeforces.com/problemset/problem/2041/G | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 74
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-F | codeforces | 2041-F | Segmentation Folds | https://codeforces.com/problemset/problem/2041/F | [
"brute force",
"dfs and similar",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 531
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-E | codeforces | 2041-E | Beautiful Array | https://codeforces.com/problemset/problem/2041/E | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10442
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-D | codeforces | 2041-D | Drunken Maze | https://codeforces.com/problemset/problem/2041/D | [
"brute force",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5718
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-C | codeforces | 2041-C | Cube | https://codeforces.com/problemset/problem/2041/C | [
"bitmasks",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2163
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-B | codeforces | 2041-B | Bowling Frame | https://codeforces.com/problemset/problem/2041/B | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7579
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2041-A | codeforces | 2041-A | The Bento Box Adventure | https://codeforces.com/problemset/problem/2041/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11787
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2040-F | codeforces | 2040-F | Number of Cubes | https://codeforces.com/problemset/problem/2040/F | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 479
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2040-E | codeforces | 2040-E | Control of Randomness | https://codeforces.com/problemset/problem/2040/E | [
"combinatorics",
"dfs and similar",
"dp",
"graphs",
"greedy",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2875
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2040-D | codeforces | 2040-D | Non Prime Tree | https://codeforces.com/problemset/problem/2040/D | [
"brute force",
"constructive algorithms",
"dfs and similar",
"greedy",
"number theory",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6142
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2040-C | codeforces | 2040-C | Ordered Permutations | https://codeforces.com/problemset/problem/2040/C | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11257
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2040-B | codeforces | 2040-B | Paint a Strip | https://codeforces.com/problemset/problem/2040/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 24942
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2040-A | codeforces | 2040-A | Game of Division | https://codeforces.com/problemset/problem/2040/A | [
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24915
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2039-H2 | codeforces | 2039-H2 | Cool Swap Walk (Hard Version) | https://codeforces.com/problemset/problem/2039/H2 | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 108
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2039-H1 | codeforces | 2039-H1 | Cool Swap Walk (Easy Version) | https://codeforces.com/problemset/problem/2039/H1 | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 111
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2039-G | codeforces | 2039-G | Shohag Loves Pebae | https://codeforces.com/problemset/problem/2039/G | [
"math",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 97
} | 2026-10-26T04:20:41.456672+00:00 |
codeforces:2039-F2 | codeforces | 2039-F2 | Shohag Loves Counting (Hard Version) | https://codeforces.com/problemset/problem/2039/F2 | [
"dp",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 305
} | 2026-10-26T04:20:41.456672+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.