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:2187-B | codeforces | 2187-B | Shortest Statement Ever | https://codeforces.com/problemset/problem/2187/B | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5154
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2187-A | codeforces | 2187-A | Restricted Sorting | https://codeforces.com/problemset/problem/2187/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15624
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2185-H | codeforces | 2185-H | BattleCows 2 | https://codeforces.com/problemset/problem/2185/H | [
"binary search",
"brute force",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 652
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2185-G | codeforces | 2185-G | Mixing MEXes | https://codeforces.com/problemset/problem/2185/G | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3200
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2185-F | codeforces | 2185-F | BattleCows | https://codeforces.com/problemset/problem/2185/F | [
"data structures",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4910
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2185-E | codeforces | 2185-E | The Robotic Rush | https://codeforces.com/problemset/problem/2185/E | [
"binary search",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9983
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2185-D | codeforces | 2185-D | OutOfMemoryError | https://codeforces.com/problemset/problem/2185/D | [
"data structures",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20320
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2185-C | codeforces | 2185-C | Shifted MEX | https://codeforces.com/problemset/problem/2185/C | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28466
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2185-B | codeforces | 2185-B | Prefix Max | https://codeforces.com/problemset/problem/2185/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39784
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2185-A | codeforces | 2185-A | Perfect Root | https://codeforces.com/problemset/problem/2185/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42107
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2184-G | codeforces | 2184-G | Nastiness of Segments | https://codeforces.com/problemset/problem/2184/G | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2877
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2184-F | codeforces | 2184-F | Cherry Tree | https://codeforces.com/problemset/problem/2184/F | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3782
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2184-E | codeforces | 2184-E | Exquisite Array | https://codeforces.com/problemset/problem/2184/E | [
"combinatorics",
"data structures",
"dsu",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5639
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2184-D | codeforces | 2184-D | Unfair Game | https://codeforces.com/problemset/problem/2184/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9314
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2184-C | codeforces | 2184-C | Huge Pile | https://codeforces.com/problemset/problem/2184/C | [
"binary search",
"dfs and similar",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21524
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2184-B | codeforces | 2184-B | Hourglass | https://codeforces.com/problemset/problem/2184/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23778
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2184-A | codeforces | 2184-A | Social Experiment | https://codeforces.com/problemset/problem/2184/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37585
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2183-I2 | codeforces | 2183-I2 | Pairs Flipping (Hard Version) | https://codeforces.com/problemset/problem/2183/I2 | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 66
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2183-I1 | codeforces | 2183-I1 | Pairs Flipping (Easy Version) | https://codeforces.com/problemset/problem/2183/I1 | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 79
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2183-H | codeforces | 2183-H | Minimise Cost | https://codeforces.com/problemset/problem/2183/H | [
"binary search",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 157
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2183-G | codeforces | 2183-G | Snake Instructions | https://codeforces.com/problemset/problem/2183/G | [
"constructive algorithms",
"greedy",
"interactive"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 218
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2183-F | codeforces | 2183-F | Jumping Man | https://codeforces.com/problemset/problem/2183/F | [
"brute force",
"combinatorics",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1090
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2183-E | codeforces | 2183-E | LCM is Legendary Counting Master | https://codeforces.com/problemset/problem/2183/E | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2820
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2183-D2 | codeforces | 2183-D2 | Tree Coloring (Hard Version) | https://codeforces.com/problemset/problem/2183/D2 | [
"combinatorics",
"constructive algorithms",
"data structures",
"dfs and similar",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2475
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2183-D1 | codeforces | 2183-D1 | Tree Coloring (Easy Version) | https://codeforces.com/problemset/problem/2183/D1 | [
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8704
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2183-C | codeforces | 2183-C | War Strategy | https://codeforces.com/problemset/problem/2183/C | [
"binary search",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10550
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2183-B | codeforces | 2183-B | Yet Another MEX Problem | https://codeforces.com/problemset/problem/2183/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16008
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2183-A | codeforces | 2183-A | Binary Array Game | https://codeforces.com/problemset/problem/2183/A | [
"games"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23528
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2182-G | codeforces | 2182-G | Short Garland | https://codeforces.com/problemset/problem/2182/G | [
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 346
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2182-F2 | codeforces | 2182-F2 | Christmas Reindeer (hard version) | https://codeforces.com/problemset/problem/2182/F2 | [
"bitmasks",
"brute force",
"combinatorics",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1079
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2182-F1 | codeforces | 2182-F1 | Christmas Reindeer (easy version) | https://codeforces.com/problemset/problem/2182/F1 | [
"bitmasks",
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1255
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2182-E | codeforces | 2182-E | New Year's Gifts | https://codeforces.com/problemset/problem/2182/E | [
"binary search",
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5492
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2182-D | codeforces | 2182-D | Christmas Tree Decoration | https://codeforces.com/problemset/problem/2182/D | [
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8828
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2182-C | codeforces | 2182-C | Production of Snowmen | https://codeforces.com/problemset/problem/2182/C | [
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15311
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2182-B | codeforces | 2182-B | New Year Cake | https://codeforces.com/problemset/problem/2182/B | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23212
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2182-A | codeforces | 2182-A | New Year String | https://codeforces.com/problemset/problem/2182/A | [
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25074
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-M | codeforces | 2181-M | Medical Parity | https://codeforces.com/problemset/problem/2181/M | [
"dp",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3240
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-L | codeforces | 2181-L | LLM Training | https://codeforces.com/problemset/problem/2181/L | [
"math",
"string suffix structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 132
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-K | codeforces | 2181-K | Knit the Grid | https://codeforces.com/problemset/problem/2181/K | [
"2-sat",
"constructive algorithms",
"graphs",
"matrices"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 63
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-J | codeforces | 2181-J | Jinx or Jackpot | https://codeforces.com/problemset/problem/2181/J | [
"brute force",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 692
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-I | codeforces | 2181-I | Irrigation Interlock | https://codeforces.com/problemset/problem/2181/I | [
"geometry"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 47
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-H | codeforces | 2181-H | Honey Cake | https://codeforces.com/problemset/problem/2181/H | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6432
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-G | codeforces | 2181-G | Greta's Game | https://codeforces.com/problemset/problem/2181/G | [
"binary search",
"dp",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 622
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-F | codeforces | 2181-F | Fragmented Nim | https://codeforces.com/problemset/problem/2181/F | [
"games"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3437
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-E | codeforces | 2181-E | Elevator Against Humanity | https://codeforces.com/problemset/problem/2181/E | [
"brute force",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 134
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-D | codeforces | 2181-D | Doorway | https://codeforces.com/problemset/problem/2181/D | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1328
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-C | codeforces | 2181-C | Cacti Classification | https://codeforces.com/problemset/problem/2181/C | [
"binary search",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 139
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-B | codeforces | 2181-B | Battle of Arrays | https://codeforces.com/problemset/problem/2181/B | [
"data structures",
"games",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5511
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2181-A | codeforces | 2181-A | Alphabet City | https://codeforces.com/problemset/problem/2181/A | [
"binary search",
"math",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3649
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2180-H2 | codeforces | 2180-H2 | Bug Is Feature (Conditional Version) | https://codeforces.com/problemset/problem/2180/H2 | [
"games"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 103
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2180-H1 | codeforces | 2180-H1 | Bug Is Feature (Unconditional Version) | https://codeforces.com/problemset/problem/2180/H1 | [
"games"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 118
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2180-G | codeforces | 2180-G | Balance | https://codeforces.com/problemset/problem/2180/G | [
"bitmasks",
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 132
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2180-F2 | codeforces | 2180-F2 | Control Car (Hard Version) | https://codeforces.com/problemset/problem/2180/F2 | [
"combinatorics",
"dp",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 221
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2180-F1 | codeforces | 2180-F1 | Control Car (Easy Version) | https://codeforces.com/problemset/problem/2180/F1 | [
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 401
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2180-E | codeforces | 2180-E | No Effect XOR | https://codeforces.com/problemset/problem/2180/E | [
"bitmasks",
"divide and conquer",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1722
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2180-D | codeforces | 2180-D | Insolvable Disks | https://codeforces.com/problemset/problem/2180/D | [
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4210
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2180-C | codeforces | 2180-C | XOR-factorization | https://codeforces.com/problemset/problem/2180/C | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6377
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2180-B | codeforces | 2180-B | Ashmal | https://codeforces.com/problemset/problem/2180/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24415
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2180-A | codeforces | 2180-A | Carnival Wheel | https://codeforces.com/problemset/problem/2180/A | [
"brute force",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25715
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2179-H | codeforces | 2179-H | Blackslex and Plants | https://codeforces.com/problemset/problem/2179/H | [
"bitmasks",
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1290
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2179-G | codeforces | 2179-G | Blackslex and Penguin Migration | https://codeforces.com/problemset/problem/2179/G | [
"brute force",
"interactive",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1191
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2179-F | codeforces | 2179-F | Blackslex and Another RGB Walking | https://codeforces.com/problemset/problem/2179/F | [
"communication",
"constructive algorithms",
"graphs",
"interactive",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2698
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2179-E | codeforces | 2179-E | Blackslex and Girls | https://codeforces.com/problemset/problem/2179/E | [
"constructive algorithms",
"geometry",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5704
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2179-D | codeforces | 2179-D | Blackslex and Penguin Civilization | https://codeforces.com/problemset/problem/2179/D | [
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13318
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2179-C | codeforces | 2179-C | Blackslex and Number Theory | https://codeforces.com/problemset/problem/2179/C | [
"implementation",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22044
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2179-B | codeforces | 2179-B | Blackslex and Showering | https://codeforces.com/problemset/problem/2179/B | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28078
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2179-A | codeforces | 2179-A | Blackslex and Password | https://codeforces.com/problemset/problem/2179/A | [
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34082
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2178-I | codeforces | 2178-I | Numbers or Fireworks | https://codeforces.com/problemset/problem/2178/I | [
"bitmasks",
"combinatorics",
"dp",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 215
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2178-H | codeforces | 2178-H | Create or Duplicate | https://codeforces.com/problemset/problem/2178/H | [
"bitmasks",
"graphs",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 305
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2178-G | codeforces | 2178-G | deCH OR Dations | https://codeforces.com/problemset/problem/2178/G | [
"bitmasks",
"data structures",
"dp",
"hashing",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 586
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2178-F | codeforces | 2178-F | Conquer or of Forest | https://codeforces.com/problemset/problem/2178/F | [
"combinatorics",
"math",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1805
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2178-E | codeforces | 2178-E | Flatten or Concatenate | https://codeforces.com/problemset/problem/2178/E | [
"binary search",
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3661
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2178-D | codeforces | 2178-D | Xmas or Hysteria | https://codeforces.com/problemset/problem/2178/D | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6646
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2178-C | codeforces | 2178-C | First or Second | https://codeforces.com/problemset/problem/2178/C | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15495
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2178-B | codeforces | 2178-B | Impost or Sus | https://codeforces.com/problemset/problem/2178/B | [
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21405
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2178-A | codeforces | 2178-A | Yes or Yes | https://codeforces.com/problemset/problem/2178/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25425
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2176-F | codeforces | 2176-F | Omega Numbers | https://codeforces.com/problemset/problem/2176/F | [
"bitmasks",
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1449
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2176-E | codeforces | 2176-E | Remove at the lowest cost | https://codeforces.com/problemset/problem/2176/E | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1230
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2176-D | codeforces | 2176-D | Fibonacci Paths | https://codeforces.com/problemset/problem/2176/D | [
"data structures",
"dp",
"graphs",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5668
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2176-C | codeforces | 2176-C | Odd Process | https://codeforces.com/problemset/problem/2176/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15538
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2176-B | codeforces | 2176-B | Optimal Shifts | https://codeforces.com/problemset/problem/2176/B | [
"bitmasks",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22686
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2176-A | codeforces | 2176-A | Operations with Inversions | https://codeforces.com/problemset/problem/2176/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28796
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2175-B | codeforces | 2175-B | XOR Array | https://codeforces.com/problemset/problem/2175/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11996
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2175-A | codeforces | 2175-A | Little Fairy's Painting | https://codeforces.com/problemset/problem/2175/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18524
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2174-F | codeforces | 2174-F | Mosaic Tree | https://codeforces.com/problemset/problem/2174/F | [
"combinatorics",
"dp",
"fft",
"math",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 431
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2174-E2 | codeforces | 2174-E2 | Game of Scientists (Version 2) | https://codeforces.com/problemset/problem/2174/E2 | [
"binary search",
"chinese remainder theorem",
"dfs and similar",
"interactive",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 92
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2174-E1 | codeforces | 2174-E1 | Game of Scientists (Version 1) | https://codeforces.com/problemset/problem/2174/E1 | [
"chinese remainder theorem",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 120
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2174-D | codeforces | 2174-D | Secret Message | https://codeforces.com/problemset/problem/2174/D | [
"data structures",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 289
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2174-C2 | codeforces | 2174-C2 | Beautiful Patterns (Hard Version) | https://codeforces.com/problemset/problem/2174/C2 | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 978
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2174-C1 | codeforces | 2174-C1 | Beautiful Patterns (Easy Version) | https://codeforces.com/problemset/problem/2174/C1 | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1122
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2174-B | codeforces | 2174-B | Wishing Cards | https://codeforces.com/problemset/problem/2174/B | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3887
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2174-A | codeforces | 2174-A | Needle in a Haystack | https://codeforces.com/problemset/problem/2174/A | [
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14029
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2173-F | codeforces | 2173-F | Isla's Memory Thresholds | https://codeforces.com/problemset/problem/2173/F | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 541
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2173-E | codeforces | 2173-E | Shiro's Mirror Duel | https://codeforces.com/problemset/problem/2173/E | [
"constructive algorithms",
"greedy",
"interactive",
"probabilities",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1494
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2173-D | codeforces | 2173-D | Taiga's Carry Chains | https://codeforces.com/problemset/problem/2173/D | [
"bitmasks",
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3573
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2173-C | codeforces | 2173-C | Kanade's Perfect Multiples | https://codeforces.com/problemset/problem/2173/C | [
"brute force",
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12171
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2173-B | codeforces | 2173-B | Niko's Tactical Cards | https://codeforces.com/problemset/problem/2173/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17918
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2173-A | codeforces | 2173-A | Sleeping Through Classes | https://codeforces.com/problemset/problem/2173/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23546
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2172-N | codeforces | 2172-N | New Kingdom | https://codeforces.com/problemset/problem/2172/N | [
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 162
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2172-M | codeforces | 2172-M | Maximum Distance To Port | https://codeforces.com/problemset/problem/2172/M | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5670
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.