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:2225-C | codeforces | 2225-C | Red-Black Pairs | https://codeforces.com/problemset/problem/2225/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14838
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2225-B | codeforces | 2225-B | Alternating String | https://codeforces.com/problemset/problem/2225/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18169
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2225-A | codeforces | 2225-A | A Number Between Two Others | https://codeforces.com/problemset/problem/2225/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22614
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2224-B | codeforces | 2224-B | Zhily and Mex and Max | https://codeforces.com/problemset/problem/2224/B | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9919
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2224-A | codeforces | 2224-A | Zhily and Array Operating | https://codeforces.com/problemset/problem/2224/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12523
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2223-F | codeforces | 2223-F | Zhily and Colorful Strings | https://codeforces.com/problemset/problem/2223/F | [
"divide and conquer",
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 126
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2223-E | codeforces | 2223-E | Zhily and Permutation | https://codeforces.com/problemset/problem/2223/E | [
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 84
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2223-D | codeforces | 2223-D | Zhily and Cycle | https://codeforces.com/problemset/problem/2223/D | [
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 400
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2223-C | codeforces | 2223-C | Zhily and Signpost | https://codeforces.com/problemset/problem/2223/C | [
"chinese remainder theorem",
"dfs and similar",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1011
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2223-B | codeforces | 2223-B | Zhily and Barknights | https://codeforces.com/problemset/problem/2223/B | [
"binary search",
"data structures",
"dp",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4126
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2223-A | codeforces | 2223-A | Zhily and Bracket Swapping | https://codeforces.com/problemset/problem/2223/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8573
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2222-H | codeforces | 2222-H | Counting Sort? | https://codeforces.com/problemset/problem/2222/H | [
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 165
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2222-G | codeforces | 2222-G | Statistics on Tree | https://codeforces.com/problemset/problem/2222/G | [
"binary search",
"brute force",
"dfs and similar",
"divide and conquer",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 239
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2222-F | codeforces | 2222-F | Building Tree | https://codeforces.com/problemset/problem/2222/F | [
"data structures",
"divide and conquer",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 773
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2222-E | codeforces | 2222-E | Seek the Truth | https://codeforces.com/problemset/problem/2222/E | [
"binary search",
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2517
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2222-D | codeforces | 2222-D | Permutation Construction | https://codeforces.com/problemset/problem/2222/D | [
"constructive algorithms",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4345
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2222-C | codeforces | 2222-C | Median Partition | https://codeforces.com/problemset/problem/2222/C | [
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6630
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2222-B | codeforces | 2222-B | Artistic Balance Tree | https://codeforces.com/problemset/problem/2222/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9452
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2222-A | codeforces | 2222-A | A Wonderful Contest | https://codeforces.com/problemset/problem/2222/A | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12858
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2220-B | codeforces | 2220-B | OIE Excursion | https://codeforces.com/problemset/problem/2220/B | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15488
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2220-A | codeforces | 2220-A | Blocked | https://codeforces.com/problemset/problem/2220/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21952
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2219-E | codeforces | 2219-E | Weird Chessboard | https://codeforces.com/problemset/problem/2219/E | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 173
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2219-D | codeforces | 2219-D | MEX Replacement on Tree | https://codeforces.com/problemset/problem/2219/D | [
"data structures",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 577
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2219-C | codeforces | 2219-C | Coloring a Red Black Tree | https://codeforces.com/problemset/problem/2219/C | [
"dfs and similar",
"dp",
"greedy",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1555
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2219-B2 | codeforces | 2219-B2 | Unique Values (Hard version) | https://codeforces.com/problemset/problem/2219/B2 | [
"binary search",
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4001
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2219-B1 | codeforces | 2219-B1 | Unique Values (Easy version) | https://codeforces.com/problemset/problem/2219/B1 | [
"binary search",
"constructive algorithms",
"divide and conquer",
"interactive",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4442
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2219-A | codeforces | 2219-A | Grid L | https://codeforces.com/problemset/problem/2219/A | [
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11398
} | 2026-10-19T04:16:34.136750+00:00 |
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 | 1,800 | {
"solved_count": 4911
} | 2026-10-19T04:16:34.136750+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 | 1,500 | {
"solved_count": 9723
} | 2026-10-19T04:16:34.136750+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 | 1,200 | {
"solved_count": 18460
} | 2026-10-19T04:16:34.136750+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 | 1,100 | {
"solved_count": 22934
} | 2026-10-19T04:16:34.136750+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 | 800 | {
"solved_count": 32665
} | 2026-10-19T04:16:34.136750+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 | 800 | {
"solved_count": 43268
} | 2026-10-19T04:16:34.136750+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 | 800 | {
"solved_count": 45851
} | 2026-10-19T04:16:34.136750+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 | 2,800 | {
"solved_count": 304
} | 2026-10-19T04:16:34.136750+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 | 2,600 | {
"solved_count": 476
} | 2026-10-19T04:16:34.136750+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 | 2,400 | {
"solved_count": 969
} | 2026-10-19T04:16:34.136750+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 | 2,100 | {
"solved_count": 2591
} | 2026-10-19T04:16:34.136750+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 | 1,900 | {
"solved_count": 3960
} | 2026-10-19T04:16:34.136750+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 | 1,300 | {
"solved_count": 12428
} | 2026-10-19T04:16:34.136750+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 | 1,000 | {
"solved_count": 19113
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2217-A | codeforces | 2217-A | The Equalizer | https://codeforces.com/problemset/problem/2217/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25789
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2216-B | codeforces | 2216-B | THU Packing Puzzle | https://codeforces.com/problemset/problem/2216/B | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5780
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2216-A | codeforces | 2216-A | Course Wishes | https://codeforces.com/problemset/problem/2216/A | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 6673
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2215-G | codeforces | 2215-G | Maze | https://codeforces.com/problemset/problem/2215/G | [
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 103
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2215-F | codeforces | 2215-F | Research | https://codeforces.com/problemset/problem/2215/F | [
"games"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 115
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2215-E | codeforces | 2215-E | Star Map | https://codeforces.com/problemset/problem/2215/E | [
"constructive algorithms",
"data structures",
"geometry",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 244
} | 2026-10-19T04:16:34.136750+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 | 2,800 | {
"solved_count": 186
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2215-C | codeforces | 2215-C | Oriented Journey | https://codeforces.com/problemset/problem/2215/C | [
"bitmasks",
"brute force",
"communication",
"constructive algorithms",
"graphs",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 939
} | 2026-10-19T04:16:34.136750+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 | 2,000 | {
"solved_count": 1397
} | 2026-10-19T04:16:34.136750+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 | 1,700 | {
"solved_count": 4150
} | 2026-10-19T04:16:34.136750+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": 3741
} | 2026-10-19T04:16:34.136750+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": 335
} | 2026-10-19T04:16:34.136750+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": 1824
} | 2026-10-19T04:16:34.136750+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": 825
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2214-F | codeforces | 2214-F | Numbers | https://codeforces.com/problemset/problem/2214/F | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1116
} | 2026-10-19T04:16:34.136750+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": 1136
} | 2026-10-19T04:16:34.136750+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": 4508
} | 2026-10-19T04:16:34.136750+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": 2011
} | 2026-10-19T04:16:34.136750+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": 7014
} | 2026-10-19T04:16:34.136750+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": 10831
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2211-H | codeforces | 2211-H | Median Deletion | https://codeforces.com/problemset/problem/2211/H | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 133
} | 2026-10-19T04:16:34.136750+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 | 3,100 | {
"solved_count": 386
} | 2026-10-19T04:16:34.136750+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 | 2,400 | {
"solved_count": 1081
} | 2026-10-19T04:16:34.136750+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 | 2,500 | {
"solved_count": 1097
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2211-D | codeforces | 2211-D | AND-array | https://codeforces.com/problemset/problem/2211/D | [
"bitmasks",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3505
} | 2026-10-19T04:16:34.136750+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 | 1,800 | {
"solved_count": 4419
} | 2026-10-19T04:16:34.136750+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 | 1,300 | {
"solved_count": 10950
} | 2026-10-19T04:16:34.136750+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 | 1,100 | {
"solved_count": 13434
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2211-A | codeforces | 2211-A | Antimedian Deletion | https://codeforces.com/problemset/problem/2211/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18221
} | 2026-10-19T04:16:34.136750+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 | 2,800 | {
"solved_count": 288
} | 2026-10-19T04:16:34.136750+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 | 2,700 | {
"solved_count": 398
} | 2026-10-19T04:16:34.136750+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 | 2,100 | {
"solved_count": 2357
} | 2026-10-19T04:16:34.136750+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 | 2,100 | {
"solved_count": 2485
} | 2026-10-19T04:16:34.136750+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 | 1,200 | {
"solved_count": 15210
} | 2026-10-19T04:16:34.136750+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 | 900 | {
"solved_count": 20256
} | 2026-10-19T04:16:34.136750+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 | 800 | {
"solved_count": 25382
} | 2026-10-19T04:16:34.136750+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 | 2,700 | {
"solved_count": 487
} | 2026-10-19T04:16:34.136750+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 | 2,200 | {
"solved_count": 2109
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2209-D | codeforces | 2209-D | Ghostfires | https://codeforces.com/problemset/problem/2209/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6139
} | 2026-10-19T04:16:34.136750+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 | 1,400 | {
"solved_count": 12309
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2209-B | codeforces | 2209-B | Array | https://codeforces.com/problemset/problem/2209/B | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22353
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2209-A | codeforces | 2209-A | Flip Flops | https://codeforces.com/problemset/problem/2209/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24017
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2208-E | codeforces | 2208-E | Counting Cute Arrays | https://codeforces.com/problemset/problem/2208/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 505
} | 2026-10-19T04:16:34.136750+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 | 2,200 | {
"solved_count": 2202
} | 2026-10-19T04:16:34.136750+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 | 1,800 | {
"solved_count": 5047
} | 2026-10-19T04:16:34.136750+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 | 1,300 | {
"solved_count": 13229
} | 2026-10-19T04:16:34.136750+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 | 1,100 | {
"solved_count": 15590
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2208-A | codeforces | 2208-A | Bingo Candies | https://codeforces.com/problemset/problem/2208/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22584
} | 2026-10-19T04:16:34.136750+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 | 3,500 | {
"solved_count": 89
} | 2026-10-19T04:16:34.136750+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 | 3,500 | {
"solved_count": 83
} | 2026-10-19T04:16:34.136750+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 | 3,500 | {
"solved_count": 83
} | 2026-10-19T04:16:34.136750+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 | 3,300 | {
"solved_count": 241
} | 2026-10-19T04:16:34.136750+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 | 3,000 | {
"solved_count": 343
} | 2026-10-19T04:16:34.136750+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 | 2,400 | {
"solved_count": 1028
} | 2026-10-19T04:16:34.136750+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 | 2,200 | {
"solved_count": 1904
} | 2026-10-19T04:16:34.136750+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 | 2,200 | {
"solved_count": 2407
} | 2026-10-19T04:16:34.136750+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 | 1,600 | {
"solved_count": 6730
} | 2026-10-19T04:16:34.136750+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 | 1,600 | {
"solved_count": 6882
} | 2026-10-19T04:16:34.136750+00:00 |
codeforces:2207-A | codeforces | 2207-A | 1-1 | https://codeforces.com/problemset/problem/2207/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15417
} | 2026-10-19T04:16:34.136750+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.