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: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": 5750
} | 2026-11-02T05:37:07.883505+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": 2166
} | 2026-11-02T05:37:07.883505+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": 7586
} | 2026-11-02T05:37:07.883505+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": 11797
} | 2026-11-02T05:37:07.883505+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": 480
} | 2026-11-02T05:37:07.883505+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": 2878
} | 2026-11-02T05:37:07.883505+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": 6153
} | 2026-11-02T05:37:07.883505+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": 11268
} | 2026-11-02T05:37:07.883505+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": 24953
} | 2026-11-02T05:37:07.883505+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": 24924
} | 2026-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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-11-02T05:37:07.883505+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": 545
} | 2026-11-02T05:37:07.883505+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": 2456
} | 2026-11-02T05:37:07.883505+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": 7304
} | 2026-11-02T05:37:07.883505+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": 5171
} | 2026-11-02T05:37:07.883505+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": 14040
} | 2026-11-02T05:37:07.883505+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": 17914
} | 2026-11-02T05:37:07.883505+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": 18492
} | 2026-11-02T05:37:07.883505+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": 11680
} | 2026-11-02T05:37:07.883505+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": 350
} | 2026-11-02T05:37:07.883505+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": 8545
} | 2026-11-02T05:37:07.883505+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": 1883
} | 2026-11-02T05:37:07.883505+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": 9172
} | 2026-11-02T05:37:07.883505+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": 771
} | 2026-11-02T05:37:07.883505+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": 202
} | 2026-11-02T05:37:07.883505+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": 3148
} | 2026-11-02T05:37:07.883505+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": 506
} | 2026-11-02T05:37:07.883505+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": 160
} | 2026-11-02T05:37:07.883505+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": 936
} | 2026-11-02T05:37:07.883505+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": 7415
} | 2026-11-02T05:37:07.883505+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": 2159
} | 2026-11-02T05:37:07.883505+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": 5778
} | 2026-11-02T05:37:07.883505+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": 4012
} | 2026-11-02T05:37:07.883505+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": 3089
} | 2026-11-02T05:37:07.883505+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": 7740
} | 2026-11-02T05:37:07.883505+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": 15290
} | 2026-11-02T05:37:07.883505+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": 26426
} | 2026-11-02T05:37:07.883505+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": 26024
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2037-A | codeforces | 2037-A | Twice | https://codeforces.com/problemset/problem/2037/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36881
} | 2026-11-02T05:37:07.883505+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": 1906
} | 2026-11-02T05:37:07.883505+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": 5686
} | 2026-11-02T05:37:07.883505+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": 10002
} | 2026-11-02T05:37:07.883505+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": 16510
} | 2026-11-02T05:37:07.883505+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": 22791
} | 2026-11-02T05:37:07.883505+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": 30353
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2036-A | codeforces | 2036-A | Quintomania | https://codeforces.com/problemset/problem/2036/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41848
} | 2026-11-02T05:37:07.883505+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": 106
} | 2026-11-02T05:37:07.883505+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": 119
} | 2026-11-02T05:37:07.883505+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": 179
} | 2026-11-02T05:37:07.883505+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": 1150
} | 2026-11-02T05:37:07.883505+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": 2029
} | 2026-11-02T05:37:07.883505+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": 6012
} | 2026-11-02T05:37:07.883505+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": 11952
} | 2026-11-02T05:37:07.883505+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": 21214
} | 2026-11-02T05:37:07.883505+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": 18143
} | 2026-11-02T05:37:07.883505+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": 207
} | 2026-11-02T05:37:07.883505+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": 91
} | 2026-11-02T05:37:07.883505+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": 91
} | 2026-11-02T05:37:07.883505+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": 624
} | 2026-11-02T05:37:07.883505+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": 927
} | 2026-11-02T05:37:07.883505+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": 2111
} | 2026-11-02T05:37:07.883505+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": 6911
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2034-C | codeforces | 2034-C | Trapped in the Witch's Labyrinth | https://codeforces.com/problemset/problem/2034/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9527
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2034-B | codeforces | 2034-B | Rakhsh's Revival | https://codeforces.com/problemset/problem/2034/B | [
"data structures",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16437
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2034-A | codeforces | 2034-A | King Keykhosrow's Mystery | https://codeforces.com/problemset/problem/2034/A | [
"brute force",
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18803
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2033-G | codeforces | 2033-G | Sakurako and Chefir | https://codeforces.com/problemset/problem/2033/G | [
"data structures",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2120
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2033-F | codeforces | 2033-F | Kosuke's Sloth | https://codeforces.com/problemset/problem/2033/F | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7450
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2033-E | codeforces | 2033-E | Sakurako, Kosuke, and the Permutation | https://codeforces.com/problemset/problem/2033/E | [
"brute force",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15051
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2033-D | codeforces | 2033-D | Kousuke's Assignment | https://codeforces.com/problemset/problem/2033/D | [
"data structures",
"dp",
"dsu",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18859
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2033-C | codeforces | 2033-C | Sakurako's Field Trip | https://codeforces.com/problemset/problem/2033/C | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18598
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2033-B | codeforces | 2033-B | Sakurako and Water | https://codeforces.com/problemset/problem/2033/B | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 29587
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2033-A | codeforces | 2033-A | Sakurako and Kosuke | https://codeforces.com/problemset/problem/2033/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42289
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2032-F | codeforces | 2032-F | Peanuts | https://codeforces.com/problemset/problem/2032/F | [
"combinatorics",
"dp",
"games",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 513
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2032-E | codeforces | 2032-E | Balanced | https://codeforces.com/problemset/problem/2032/E | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1475
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2032-D | codeforces | 2032-D | Genokraken | https://codeforces.com/problemset/problem/2032/D | [
"constructive algorithms",
"data structures",
"graphs",
"greedy",
"implementation",
"interactive",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6432
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2032-C | codeforces | 2032-C | Trinity | https://codeforces.com/problemset/problem/2032/C | [
"binary search",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16947
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2032-B | codeforces | 2032-B | Medians | https://codeforces.com/problemset/problem/2032/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21342
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2032-A | codeforces | 2032-A | Circuit | https://codeforces.com/problemset/problem/2032/A | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25149
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2031-F | codeforces | 2031-F | Penchick and Even Medians | https://codeforces.com/problemset/problem/2031/F | [
"binary search",
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 495
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2031-E | codeforces | 2031-E | Penchick and Chloe's Trees | https://codeforces.com/problemset/problem/2031/E | [
"data structures",
"dfs and similar",
"dp",
"greedy",
"implementation",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2824
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2031-D | codeforces | 2031-D | Penchick and Desert Rabbit | https://codeforces.com/problemset/problem/2031/D | [
"binary search",
"data structures",
"dfs and similar",
"dp",
"dsu",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10337
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2031-C | codeforces | 2031-C | Penchick and BBQ Buns | https://codeforces.com/problemset/problem/2031/C | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16295
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2031-B | codeforces | 2031-B | Penchick and Satay Sticks | https://codeforces.com/problemset/problem/2031/B | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21491
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2031-A | codeforces | 2031-A | Penchick and Modern Monument | https://codeforces.com/problemset/problem/2031/A | [
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21510
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2030-G2 | codeforces | 2030-G2 | The Destruction of the Universe (Hard Version) | https://codeforces.com/problemset/problem/2030/G2 | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 284
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2030-G1 | codeforces | 2030-G1 | The Destruction of the Universe (Easy Version) | https://codeforces.com/problemset/problem/2030/G1 | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 311
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2030-F | codeforces | 2030-F | Orangutan Approved Subarrays | https://codeforces.com/problemset/problem/2030/F | [
"binary search",
"data structures",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1261
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2030-E | codeforces | 2030-E | MEXimize the Score | https://codeforces.com/problemset/problem/2030/E | [
"combinatorics",
"data structures",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2079
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2030-D | codeforces | 2030-D | QED's Favorite Permutation | https://codeforces.com/problemset/problem/2030/D | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9055
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2030-C | codeforces | 2030-C | A TRUE Battle | https://codeforces.com/problemset/problem/2030/C | [
"brute force",
"games",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20428
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2030-B | codeforces | 2030-B | Minimise Oneness | https://codeforces.com/problemset/problem/2030/B | [
"combinatorics",
"constructive algorithms",
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24306
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2030-A | codeforces | 2030-A | A Gift From Orangutan | https://codeforces.com/problemset/problem/2030/A | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28092
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2029-I | codeforces | 2029-I | Variance Challenge | https://codeforces.com/problemset/problem/2029/I | [
"flows",
"graphs",
"greedy"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 185
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2029-H | codeforces | 2029-H | Message Spread | https://codeforces.com/problemset/problem/2029/H | [
"bitmasks",
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 121
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2029-G | codeforces | 2029-G | Balanced Problem | https://codeforces.com/problemset/problem/2029/G | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 288
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2029-F | codeforces | 2029-F | Palindrome Everywhere | https://codeforces.com/problemset/problem/2029/F | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 885
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:2029-E | codeforces | 2029-E | Common Generator | https://codeforces.com/problemset/problem/2029/E | [
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3668
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.