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:2045-C | codeforces | 2045-C | Saraga | https://codeforces.com/problemset/problem/2045/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7299
} | 2026-06-01T05:00:40.145500+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": 1732
} | 2026-06-01T05:00:40.145500+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": 2594
} | 2026-06-01T05:00:40.145500+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": 2614
} | 2026-06-01T05:00:40.145500+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": 3884
} | 2026-06-01T05:00:40.145500+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": 7419
} | 2026-06-01T05:00:40.145500+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": 6140
} | 2026-06-01T05:00:40.145500+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": 18244
} | 2026-06-01T05:00:40.145500+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": 24223
} | 2026-06-01T05:00:40.145500+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": 45528
} | 2026-06-01T05:00:40.145500+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": 52395
} | 2026-06-01T05:00:40.145500+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": 61710
} | 2026-06-01T05:00:40.145500+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": 329
} | 2026-06-01T05:00:40.145500+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": 910
} | 2026-06-01T05:00:40.145500+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": 1846
} | 2026-06-01T05:00:40.145500+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": 7727
} | 2026-06-01T05:00:40.145500+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": 11301
} | 2026-06-01T05:00:40.145500+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": 21873
} | 2026-06-01T05:00:40.145500+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": 27057
} | 2026-06-01T05:00:40.145500+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": 912
} | 2026-06-01T05:00:40.145500+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": 527
} | 2026-06-01T05:00:40.145500+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": 5318
} | 2026-06-01T05:00:40.145500+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": 8704
} | 2026-06-01T05:00:40.145500+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": 19569
} | 2026-06-01T05:00:40.145500+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": 20882
} | 2026-06-01T05:00:40.145500+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": 82
} | 2026-06-01T05:00:40.145500+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": 1340
} | 2026-06-01T05:00:40.145500+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": 70
} | 2026-06-01T05:00:40.145500+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": 122
} | 2026-06-01T05:00:40.145500+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": 270
} | 2026-06-01T05:00:40.145500+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": 678
} | 2026-06-01T05:00:40.145500+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": 1042
} | 2026-06-01T05:00:40.145500+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": 67
} | 2026-06-01T05:00:40.145500+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": 513
} | 2026-06-01T05:00:40.145500+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": 9949
} | 2026-06-01T05:00:40.145500+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": 4953
} | 2026-06-01T05:00:40.145500+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": 2032
} | 2026-06-01T05:00:40.145500+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": 7240
} | 2026-06-01T05:00:40.145500+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": 11379
} | 2026-06-01T05:00:40.145500+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": 462
} | 2026-06-01T05:00:40.145500+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": 2690
} | 2026-06-01T05:00:40.145500+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": 5878
} | 2026-06-01T05:00:40.145500+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": 10855
} | 2026-06-01T05:00:40.145500+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": 24236
} | 2026-06-01T05:00:40.145500+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": 24477
} | 2026-06-01T05:00:40.145500+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": 94
} | 2026-06-01T05:00:40.145500+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": 102
} | 2026-06-01T05:00:40.145500+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": 83
} | 2026-06-01T05:00:40.145500+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": 296
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2039-F1 | codeforces | 2039-F1 | Shohag Loves Counting (Easy Version) | https://codeforces.com/problemset/problem/2039/F1 | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 514
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2039-E | codeforces | 2039-E | Shohag Loves Inversions | https://codeforces.com/problemset/problem/2039/E | [
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2383
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2039-D | codeforces | 2039-D | Shohag Loves GCD | https://codeforces.com/problemset/problem/2039/D | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7024
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2039-C2 | codeforces | 2039-C2 | Shohag Loves XOR (Hard Version) | https://codeforces.com/problemset/problem/2039/C2 | [
"bitmasks",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4998
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2039-C1 | codeforces | 2039-C1 | Shohag Loves XOR (Easy Version) | https://codeforces.com/problemset/problem/2039/C1 | [
"bitmasks",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13600
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2039-B | codeforces | 2039-B | Shohag Loves Strings | https://codeforces.com/problemset/problem/2039/B | [
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17396
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2039-A | codeforces | 2039-A | Shohag Loves Mod | https://codeforces.com/problemset/problem/2039/A | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18162
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-N | codeforces | 2038-N | Fixing the Expression | https://codeforces.com/problemset/problem/2038/N | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11376
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-M | codeforces | 2038-M | Royal Flush | https://codeforces.com/problemset/problem/2038/M | [
"dp",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 331
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-L | codeforces | 2038-L | Bridge Renovation | https://codeforces.com/problemset/problem/2038/L | [
"brute force",
"dp",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8066
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-K | codeforces | 2038-K | Grid Walk | https://codeforces.com/problemset/problem/2038/K | [
"brute force",
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1789
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-J | codeforces | 2038-J | Waiting for... | https://codeforces.com/problemset/problem/2038/J | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8822
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-I | codeforces | 2038-I | Polyathlon | https://codeforces.com/problemset/problem/2038/I | [
"binary search",
"data structures",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 750
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-H | codeforces | 2038-H | Galactic Council | https://codeforces.com/problemset/problem/2038/H | [
"flows"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 185
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-G | codeforces | 2038-G | Guess One Character | https://codeforces.com/problemset/problem/2038/G | [
"constructive algorithms",
"implementation",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2983
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-F | codeforces | 2038-F | Alternative Platforms | https://codeforces.com/problemset/problem/2038/F | [
"combinatorics",
"data structures",
"fft",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 485
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-E | codeforces | 2038-E | Barrels | https://codeforces.com/problemset/problem/2038/E | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-D | codeforces | 2038-D | Divide OR Conquer | https://codeforces.com/problemset/problem/2038/D | [
"binary search",
"bitmasks",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 862
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-C | codeforces | 2038-C | DIY | https://codeforces.com/problemset/problem/2038/C | [
"data structures",
"geometry",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7004
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-B | codeforces | 2038-B | Make It Equal | https://codeforces.com/problemset/problem/2038/B | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1937
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2038-A | codeforces | 2038-A | Bonus Project | https://codeforces.com/problemset/problem/2038/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2037-G | codeforces | 2037-G | Natlan Exploring | https://codeforces.com/problemset/problem/2037/G | [
"bitmasks",
"combinatorics",
"data structures",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3777
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2037-F | codeforces | 2037-F | Ardent Flames | https://codeforces.com/problemset/problem/2037/F | [
"binary search",
"data structures",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2981
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2037-E | codeforces | 2037-E | Kachina's Favorite Binary String | https://codeforces.com/problemset/problem/2037/E | [
"dp",
"greedy",
"interactive",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7438
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2037-D | codeforces | 2037-D | Sharky Surfing | https://codeforces.com/problemset/problem/2037/D | [
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14834
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2037-C | codeforces | 2037-C | Superultra's Favorite Permutation | https://codeforces.com/problemset/problem/2037/C | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25661
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2037-B | codeforces | 2037-B | Intercepted Inputs | https://codeforces.com/problemset/problem/2037/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25586
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2037-A | codeforces | 2037-A | Twice | https://codeforces.com/problemset/problem/2037/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35885
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2036-G | codeforces | 2036-G | Library of Magic | https://codeforces.com/problemset/problem/2036/G | [
"binary search",
"constructive algorithms",
"divide and conquer",
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1690
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2036-F | codeforces | 2036-F | XORificator 3000 | https://codeforces.com/problemset/problem/2036/F | [
"bitmasks",
"dp",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5334
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2036-E | codeforces | 2036-E | Reverse the Rivers | https://codeforces.com/problemset/problem/2036/E | [
"binary search",
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9638
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2036-D | codeforces | 2036-D | I Love 1543 | https://codeforces.com/problemset/problem/2036/D | [
"brute force",
"implementation",
"matrices"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16095
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2036-C | codeforces | 2036-C | Anya and 1100 | https://codeforces.com/problemset/problem/2036/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22282
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2036-B | codeforces | 2036-B | Startup | https://codeforces.com/problemset/problem/2036/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29798
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2036-A | codeforces | 2036-A | Quintomania | https://codeforces.com/problemset/problem/2036/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40818
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2035-H | codeforces | 2035-H | Peak Productivity Forces | https://codeforces.com/problemset/problem/2035/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 100
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2035-G2 | codeforces | 2035-G2 | Go Learn! (Hard Version) | https://codeforces.com/problemset/problem/2035/G2 | [
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 112
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2035-G1 | codeforces | 2035-G1 | Go Learn! (Easy Version) | https://codeforces.com/problemset/problem/2035/G1 | [
"dp",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 172
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2035-F | codeforces | 2035-F | Tree Operations | https://codeforces.com/problemset/problem/2035/F | [
"binary search",
"brute force",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1104
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2035-E | codeforces | 2035-E | Monster | https://codeforces.com/problemset/problem/2035/E | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1975
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2035-D | codeforces | 2035-D | Yet Another Real Number Problem | https://codeforces.com/problemset/problem/2035/D | [
"binary search",
"data structures",
"divide and conquer",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5851
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2035-C | codeforces | 2035-C | Alya and Permutation | https://codeforces.com/problemset/problem/2035/C | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11611
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2035-B | codeforces | 2035-B | Everyone Loves Tres | https://codeforces.com/problemset/problem/2035/B | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20670
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2035-A | codeforces | 2035-A | Sliding | https://codeforces.com/problemset/problem/2035/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17879
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2034-H | codeforces | 2034-H | Rayan vs. Rayaneh | https://codeforces.com/problemset/problem/2034/H | [
"brute force",
"dfs and similar",
"dp",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 196
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2034-G2 | codeforces | 2034-G2 | Simurgh's Watch (Hard Version) | https://codeforces.com/problemset/problem/2034/G2 | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 82
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2034-G1 | codeforces | 2034-G1 | Simurgh's Watch (Easy Version) | https://codeforces.com/problemset/problem/2034/G1 | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 78
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2034-F2 | codeforces | 2034-F2 | Khayyam's Royal Decree (Hard Version) | https://codeforces.com/problemset/problem/2034/F2 | [
"combinatorics",
"dp",
"math",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 602
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2034-F1 | codeforces | 2034-F1 | Khayyam's Royal Decree (Easy Version) | https://codeforces.com/problemset/problem/2034/F1 | [
"combinatorics",
"dp",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 898
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2034-E | codeforces | 2034-E | Permutations Harmony | https://codeforces.com/problemset/problem/2034/E | [
"combinatorics",
"constructive algorithms",
"greedy",
"hashing",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2032
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2034-D | codeforces | 2034-D | Darius' Wisdom | https://codeforces.com/problemset/problem/2034/D | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6659
} | 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.