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:2218-G | codeforces | 2218-G | The 67th Iteration of "Counting is Fun" | https://codeforces.com/problemset/problem/2218/G | [
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 2939
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2218-F | codeforces | 2218-F | The 67th Tree Problem | https://codeforces.com/problemset/problem/2218/F | [
"constructive algorithms",
"implementation",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 6104
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2218-E | codeforces | 2218-E | The 67th XOR Problem | https://codeforces.com/problemset/problem/2218/E | [
"binary search",
"bitmasks",
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 12090
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2218-D | codeforces | 2218-D | The 67th OEIS Problem | https://codeforces.com/problemset/problem/2218/D | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 16278
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2218-C | codeforces | 2218-C | The 67th Permutation Problem | https://codeforces.com/problemset/problem/2218/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 23329
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2218-B | codeforces | 2218-B | The 67th 6-7 Integer Problem | https://codeforces.com/problemset/problem/2218/B | [
"greedy",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 29305
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2218-A | codeforces | 2218-A | The 67th Integer Problem | https://codeforces.com/problemset/problem/2218/A | [
"brute force",
"games",
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 30136
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2217-H | codeforces | 2217-H | Closer | https://codeforces.com/problemset/problem/2217/H | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 141
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2217-G | codeforces | 2217-G | Down the Pivot | https://codeforces.com/problemset/problem/2217/G | [
"combinatorics",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 257
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2217-F | codeforces | 2217-F | Interval Game | https://codeforces.com/problemset/problem/2217/F | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"dp",
"games",
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | null | {
"solved_count": 549
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2217-E | codeforces | 2217-E | Definitely Larger | https://codeforces.com/problemset/problem/2217/E | [
"binary search",
"constructive algorithms",
"data structures",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 1699
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2217-D | codeforces | 2217-D | Flip the Bit (Hard Version) | https://codeforces.com/problemset/problem/2217/D | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 2836
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2217-C | codeforces | 2217-C | Grid Covering | https://codeforces.com/problemset/problem/2217/C | [
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 9277
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2217-B | codeforces | 2217-B | Flip the Bit (Easy Version) | https://codeforces.com/problemset/problem/2217/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 14411
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2217-A | codeforces | 2217-A | The Equalizer | https://codeforces.com/problemset/problem/2217/A | [
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 19293
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2216-B | codeforces | 2216-B | THU Packing Puzzle | https://codeforces.com/problemset/problem/2216/B | [
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 1984
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2216-A | codeforces | 2216-A | Course Wishes | https://codeforces.com/problemset/problem/2216/A | [
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 3043
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2215-G | codeforces | 2215-G | Maze | https://codeforces.com/problemset/problem/2215/G | [
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 4
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2215-F | codeforces | 2215-F | Research | https://codeforces.com/problemset/problem/2215/F | [
"games"
] | null | null | stdin_stdout | null | {
"solved_count": 9
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2215-E | codeforces | 2215-E | Star Map | https://codeforces.com/problemset/problem/2215/E | [
"constructive algorithms",
"data structures",
"geometry",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 91
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2215-D | codeforces | 2215-D | EXPloration, EXPloitation, and Gain Some EXPerience! | https://codeforces.com/problemset/problem/2215/D | [
"bitmasks",
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 59
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2215-C | codeforces | 2215-C | Oriented Journey | https://codeforces.com/problemset/problem/2215/C | [
"bitmasks",
"communication",
"constructive algorithms",
"graphs",
"hashing",
"interactive",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 372
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2215-B | codeforces | 2215-B | RReeppeettiittiioonn | https://codeforces.com/problemset/problem/2215/B | [
"binary search",
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 612
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2215-A | codeforces | 2215-A | Interval Mod | https://codeforces.com/problemset/problem/2215/A | [
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 1264
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2214-J | codeforces | 2214-J | Special Problem | https://codeforces.com/problemset/problem/2214/J | [
"*special",
"brute force",
"games",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 3451
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2214-I | codeforces | 2214-I | You Are a Robot | https://codeforces.com/problemset/problem/2214/I | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 278
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2214-H | codeforces | 2214-H | Double Vision | https://codeforces.com/problemset/problem/2214/H | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1530
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2214-G | codeforces | 2214-G | Anomaly | https://codeforces.com/problemset/problem/2214/G | [
"*special",
"communication"
] | null | null | stdin_stdout | null | {
"solved_count": 664
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2214-F | codeforces | 2214-F | Numbers | https://codeforces.com/problemset/problem/2214/F | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 836
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2214-E | codeforces | 2214-E | Shortest Paths | https://codeforces.com/problemset/problem/2214/E | [
"*special",
"shortest paths"
] | null | null | stdin_stdout | null | {
"solved_count": 1008
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2214-D | codeforces | 2214-D | Neural Feud | https://codeforces.com/problemset/problem/2214/D | [
"*special",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 4152
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2214-C | codeforces | 2214-C | And? | https://codeforces.com/problemset/problem/2214/C | [
"*special",
"bitmasks"
] | null | null | stdin_stdout | null | {
"solved_count": 1709
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2214-B | codeforces | 2214-B | Are You Smiling? | https://codeforces.com/problemset/problem/2214/B | [
"*special",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 6290
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2214-A | codeforces | 2214-A | Odd One Out | https://codeforces.com/problemset/problem/2214/A | [
"*special",
"graph matchings",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 9785
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2211-H | codeforces | 2211-H | Median Deletion | https://codeforces.com/problemset/problem/2211/H | [] | null | null | stdin_stdout | null | {
"solved_count": 73
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2211-G | codeforces | 2211-G | Rational Bubble Sort | https://codeforces.com/problemset/problem/2211/G | [
"constructive algorithms",
"geometry",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 253
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2211-F | codeforces | 2211-F | Learning Binary Search | https://codeforces.com/problemset/problem/2211/F | [
"combinatorics",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 843
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2211-E | codeforces | 2211-E | Minimum Path Cover | https://codeforces.com/problemset/problem/2211/E | [
"brute force",
"dp",
"greedy",
"interactive",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 798
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2211-D | codeforces | 2211-D | AND-array | https://codeforces.com/problemset/problem/2211/D | [
"bitmasks",
"combinatorics",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 2692
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2211-C2 | codeforces | 2211-C2 | Equal Multisets (Hard Version) | https://codeforces.com/problemset/problem/2211/C2 | [
"constructive algorithms",
"dsu",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 3434
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2211-C1 | codeforces | 2211-C1 | Equal Multisets (Easy Version) | https://codeforces.com/problemset/problem/2211/C1 | [
"binary search",
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | null | {
"solved_count": 8467
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2211-B | codeforces | 2211-B | Mickey Mouse Constructive | https://codeforces.com/problemset/problem/2211/B | [
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 11016
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2211-A | codeforces | 2211-A | Antimedian Deletion | https://codeforces.com/problemset/problem/2211/A | [
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 15121
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2210-F | codeforces | 2210-F | A Simple Problem | https://codeforces.com/problemset/problem/2210/F | [
"binary search",
"data structures",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 182
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2210-E | codeforces | 2210-E | Binary Strings are Simple? | https://codeforces.com/problemset/problem/2210/E | [
"constructive algorithms",
"implementation",
"interactive",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 290
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2210-D | codeforces | 2210-D | A Simple RBS Problem | https://codeforces.com/problemset/problem/2210/D | [
"constructive algorithms",
"math",
"strings",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 1861
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2210-C2 | codeforces | 2210-C2 | A Simple GCD Problem (Hard Version) | https://codeforces.com/problemset/problem/2210/C2 | [
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 1975
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2210-C1 | codeforces | 2210-C1 | A Simple GCD Problem (Easy Version) | https://codeforces.com/problemset/problem/2210/C1 | [
"greedy",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 11864
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2210-B | codeforces | 2210-B | Simply Sitting on Chairs | https://codeforces.com/problemset/problem/2210/B | [
"data structures",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 16549
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2210-A | codeforces | 2210-A | A Simple Sequence | https://codeforces.com/problemset/problem/2210/A | [
"constructive algorithms",
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 20877
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2209-F | codeforces | 2209-F | Dynamic Values And Maximum Sum | https://codeforces.com/problemset/problem/2209/F | [
"data structures",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 383
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2209-E | codeforces | 2209-E | A Trivial String Problem | https://codeforces.com/problemset/problem/2209/E | [
"brute force",
"dp",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 1646
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2209-D | codeforces | 2209-D | Ghostfires | https://codeforces.com/problemset/problem/2209/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 5051
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2209-C | codeforces | 2209-C | Find the Zero | https://codeforces.com/problemset/problem/2209/C | [
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 10046
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2209-B | codeforces | 2209-B | Array | https://codeforces.com/problemset/problem/2209/B | [
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 18527
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2209-A | codeforces | 2209-A | Flip Flops | https://codeforces.com/problemset/problem/2209/A | [
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 20590
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2208-E | codeforces | 2208-E | Counting Cute Arrays | https://codeforces.com/problemset/problem/2208/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 397
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2208-D2 | codeforces | 2208-D2 | Tree Orientation (Hard Version) | https://codeforces.com/problemset/problem/2208/D2 | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 1725
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2208-D1 | codeforces | 2208-D1 | Tree Orientation (Easy Version) | https://codeforces.com/problemset/problem/2208/D1 | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"matrices",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 3998
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2208-C | codeforces | 2208-C | Stamina and Tasks | https://codeforces.com/problemset/problem/2208/C | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 10422
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2208-B | codeforces | 2208-B | Cyclists | https://codeforces.com/problemset/problem/2208/B | [
"brute force",
"games",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 13094
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2208-A | codeforces | 2208-A | Bingo Candies | https://codeforces.com/problemset/problem/2208/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 19317
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2207-H3 | codeforces | 2207-H3 | Bowser's Castle (Hard Version) | https://codeforces.com/problemset/problem/2207/H3 | [
"constructive algorithms",
"divide and conquer",
"interactive",
"trees",
"two pointers"
] | null | null | stdin_stdout | null | {
"solved_count": 51
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2207-H2 | codeforces | 2207-H2 | Bowser's Castle (Medium Version) | https://codeforces.com/problemset/problem/2207/H2 | [
"constructive algorithms",
"divide and conquer",
"interactive",
"trees",
"two pointers"
] | null | null | stdin_stdout | null | {
"solved_count": 37
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2207-H1 | codeforces | 2207-H1 | Bowser's Castle (Easy Version) | https://codeforces.com/problemset/problem/2207/H1 | [
"binary search",
"constructive algorithms",
"divide and conquer",
"greedy",
"interactive",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 49
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2207-G | codeforces | 2207-G | Toothless | https://codeforces.com/problemset/problem/2207/G | [
"constructive algorithms",
"dfs and similar",
"dsu"
] | null | null | stdin_stdout | null | {
"solved_count": 140
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2207-F | codeforces | 2207-F | Hanabi | https://codeforces.com/problemset/problem/2207/F | [
"binary search",
"data structures",
"dp",
"dsu",
"flows",
"graph matchings",
"graphs",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 257
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2207-E2 | codeforces | 2207-E2 | N-MEX (Counting Version) | https://codeforces.com/problemset/problem/2207/E2 | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 809
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2207-E1 | codeforces | 2207-E1 | N-MEX (Constructive Version) | https://codeforces.com/problemset/problem/2207/E1 | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 1586
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2207-D | codeforces | 2207-D | Boxed Like a Fish | https://codeforces.com/problemset/problem/2207/D | [
"dfs and similar",
"dp",
"games",
"shortest paths",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 2020
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2207-C | codeforces | 2207-C | Where's My Water? | https://codeforces.com/problemset/problem/2207/C | [
"data structures",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 5039
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2207-B | codeforces | 2207-B | One Night At Freddy's | https://codeforces.com/problemset/problem/2207/B | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 5492
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2207-A | codeforces | 2207-A | 1-1 | https://codeforces.com/problemset/problem/2207/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 13129
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-M | codeforces | 2206-M | Deformed Balance | https://codeforces.com/problemset/problem/2206/M | [] | null | null | stdin_stdout | null | {
"solved_count": 37
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-L | codeforces | 2206-L | Onion | https://codeforces.com/problemset/problem/2206/L | [] | null | null | stdin_stdout | null | {
"solved_count": 31
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-K | codeforces | 2206-K | Time Display Stickers | https://codeforces.com/problemset/problem/2206/K | [
"binary search"
] | null | null | stdin_stdout | null | {
"solved_count": 1125
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-J | codeforces | 2206-J | Worldwide Playlist | https://codeforces.com/problemset/problem/2206/J | [
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 837
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-I | codeforces | 2206-I | Growth Factor | https://codeforces.com/problemset/problem/2206/I | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 150
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-H | codeforces | 2206-H | Reflect Sort | https://codeforces.com/problemset/problem/2206/H | [
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 732
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-G | codeforces | 2206-G | Extra Transition | https://codeforces.com/problemset/problem/2206/G | [
"graphs"
] | null | null | stdin_stdout | null | {
"solved_count": 68
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-F | codeforces | 2206-F | Minesweeper String | https://codeforces.com/problemset/problem/2206/F | [
"fft",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 370
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-E | codeforces | 2206-E | Parallel Sums | https://codeforces.com/problemset/problem/2206/E | [
"data structures",
"geometry"
] | null | null | stdin_stdout | null | {
"solved_count": 349
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-D | codeforces | 2206-D | Christmas Tree Un-decoration | https://codeforces.com/problemset/problem/2206/D | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 209
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-C | codeforces | 2206-C | Upside Down Dijkstra | https://codeforces.com/problemset/problem/2206/C | [
"dfs and similar"
] | null | null | stdin_stdout | null | {
"solved_count": 563
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-B | codeforces | 2206-B | Subtree Removal Game | https://codeforces.com/problemset/problem/2206/B | [
"binary search",
"games",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 296
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2206-A | codeforces | 2206-A | Compare Suffixes | https://codeforces.com/problemset/problem/2206/A | [
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 74
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2205-G | codeforces | 2205-G | Simons and Diophantus Equation | https://codeforces.com/problemset/problem/2205/G | [
"bitmasks",
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 193
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2205-F | codeforces | 2205-F | Simons and Reconstructing His Roads | https://codeforces.com/problemset/problem/2205/F | [
"constructive algorithms",
"data structures",
"dsu",
"graphs"
] | null | null | stdin_stdout | null | {
"solved_count": 609
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2205-E | codeforces | 2205-E | Simons and Dividing the Rhythm | https://codeforces.com/problemset/problem/2205/E | [
"combinatorics",
"data structures",
"dp",
"dsu",
"math",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 1495
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2205-D | codeforces | 2205-D | Simons and Beating Peaks | https://codeforces.com/problemset/problem/2205/D | [
"data structures",
"divide and conquer",
"dp",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 4655
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2205-C | codeforces | 2205-C | Simons and Posting Blogs | https://codeforces.com/problemset/problem/2205/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | null | {
"solved_count": 7351
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2205-B | codeforces | 2205-B | Simons and Cakes for Success | https://codeforces.com/problemset/problem/2205/B | [
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 15488
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2205-A | codeforces | 2205-A | Simons and Making It Beautiful | https://codeforces.com/problemset/problem/2205/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": 16730
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2204-G | codeforces | 2204-G | Grid Path | https://codeforces.com/problemset/problem/2204/G | [
"dp",
"graphs",
"matrices"
] | null | null | stdin_stdout | null | {
"solved_count": 379
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2204-F | codeforces | 2204-F | Sum of Fractions | https://codeforces.com/problemset/problem/2204/F | [
"binary search",
"brute force",
"combinatorics",
"data structures",
"greedy",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | null | {
"solved_count": 1159
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2204-E | codeforces | 2204-E | Sum of Digits (and Again) | https://codeforces.com/problemset/problem/2204/E | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 4566
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2204-D | codeforces | 2204-D | Alternating Path | https://codeforces.com/problemset/problem/2204/D | [
"constructive algorithms",
"dfs and similar",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | null | {
"solved_count": 8414
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2204-C | codeforces | 2204-C | Spring | https://codeforces.com/problemset/problem/2204/C | [
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 16524
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2204-B | codeforces | 2204-B | Right Maximum | https://codeforces.com/problemset/problem/2204/B | [
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 18735
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2204-A | codeforces | 2204-A | Passing the Ball | https://codeforces.com/problemset/problem/2204/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 20918
} | 2026-04-13T03:38:27.662191+00:00 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 26