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:1938-B | codeforces | 1938-B | Attraction Score | https://codeforces.com/problemset/problem/1938/B | [] | null | null | stdin_stdout | 3,000 | {
"solved_count": 234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1938-A | codeforces | 1938-A | Antiparticle Antiphysics | https://codeforces.com/problemset/problem/1938/A | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 79
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1937-B | codeforces | 1937-B | Binary Path | https://codeforces.com/problemset/problem/1937/B | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17399
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1937-A | codeforces | 1937-A | Shuffle Party | https://codeforces.com/problemset/problem/1937/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24776
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1936-F | codeforces | 1936-F | Grand Finale: Circles | https://codeforces.com/problemset/problem/1936/F | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 171
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1936-E | codeforces | 1936-E | Yet Yet Another Permutation Problem | https://codeforces.com/problemset/problem/1936/E | [
"divide and conquer",
"fft",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 147
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1936-D | codeforces | 1936-D | Bitwise Paradox | https://codeforces.com/problemset/problem/1936/D | [
"binary search",
"bitmasks",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 629
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1936-C | codeforces | 1936-C | Pokémon Arena | https://codeforces.com/problemset/problem/1936/C | [
"data structures",
"graphs",
"greedy",
"implementation",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1738
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1936-B | codeforces | 1936-B | Pinball | https://codeforces.com/problemset/problem/1936/B | [
"binary search",
"data structures",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3575
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1936-A | codeforces | 1936-A | Bitwise Operation Wizard | https://codeforces.com/problemset/problem/1936/A | [
"bitmasks",
"constructive algorithms",
"greedy",
"interactive",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8694
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1935-F | codeforces | 1935-F | Andrey's Tree | https://codeforces.com/problemset/problem/1935/F | [
"binary search",
"constructive algorithms",
"data structures",
"dfs and similar",
"dsu",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 610
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1935-E | codeforces | 1935-E | Distance Learning Courses in MAC | https://codeforces.com/problemset/problem/1935/E | [
"bitmasks",
"brute force",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1657
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1935-D | codeforces | 1935-D | Exam in MAC | https://codeforces.com/problemset/problem/1935/D | [
"binary search",
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10784
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1935-C | codeforces | 1935-C | Messenger in MAC | https://codeforces.com/problemset/problem/1935/C | [
"binary search",
"brute force",
"constructive algorithms",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9823
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1935-B | codeforces | 1935-B | Informatics in MAC | https://codeforces.com/problemset/problem/1935/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20951
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1935-A | codeforces | 1935-A | Entertainment in MAC | https://codeforces.com/problemset/problem/1935/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30397
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1934-E | codeforces | 1934-E | Weird LCM Operations | https://codeforces.com/problemset/problem/1934/E | [
"brute force",
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 345
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1934-D2 | codeforces | 1934-D2 | XOR Break --- Game Version | https://codeforces.com/problemset/problem/1934/D2 | [
"bitmasks",
"games",
"greedy",
"interactive"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1769
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1934-D1 | codeforces | 1934-D1 | XOR Break --- Solo Version | https://codeforces.com/problemset/problem/1934/D1 | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4164
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1934-C | codeforces | 1934-C | Find a Mine | https://codeforces.com/problemset/problem/1934/C | [
"binary search",
"constructive algorithms",
"geometry",
"greedy",
"interactive",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8119
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1934-B | codeforces | 1934-B | Yet Another Coin Problem | https://codeforces.com/problemset/problem/1934/B | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22110
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1934-A | codeforces | 1934-A | Too Min Too Max | https://codeforces.com/problemset/problem/1934/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27304
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1933-G | codeforces | 1933-G | Turtle Magic: Royal Turtle Shell Pattern | https://codeforces.com/problemset/problem/1933/G | [
"bitmasks",
"brute force",
"combinatorics",
"constructive algorithms",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1191
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1933-F | codeforces | 1933-F | Turtle Mission: Robot and the Earthquake | https://codeforces.com/problemset/problem/1933/F | [
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2971
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1933-E | codeforces | 1933-E | Turtle vs. Rabbit Race: Optimal Trainings | https://codeforces.com/problemset/problem/1933/E | [
"binary search",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13689
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1933-D | codeforces | 1933-D | Turtle Tenacity: Continual Mods | https://codeforces.com/problemset/problem/1933/D | [
"constructive algorithms",
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23641
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1933-C | codeforces | 1933-C | Turtle Fingers: Count the Values of k | https://codeforces.com/problemset/problem/1933/C | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25461
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1933-B | codeforces | 1933-B | Turtle Math: Fast Three Task | https://codeforces.com/problemset/problem/1933/B | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36416
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1933-A | codeforces | 1933-A | Turtle Puzzle: Rearrange and Negate | https://codeforces.com/problemset/problem/1933/A | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42213
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1932-G | codeforces | 1932-G | Moving Platforms | https://codeforces.com/problemset/problem/1932/G | [
"graphs",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1364
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1932-F | codeforces | 1932-F | Feed Cats | https://codeforces.com/problemset/problem/1932/F | [
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5693
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1932-E | codeforces | 1932-E | Final Countdown | https://codeforces.com/problemset/problem/1932/E | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10272
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1932-D | codeforces | 1932-D | Card Game | https://codeforces.com/problemset/problem/1932/D | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13489
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1932-C | codeforces | 1932-C | LR-remainders | https://codeforces.com/problemset/problem/1932/C | [
"brute force",
"data structures",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19026
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1932-B | codeforces | 1932-B | Chaya Calendar | https://codeforces.com/problemset/problem/1932/B | [
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23732
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1932-A | codeforces | 1932-A | Thorns and Coins | https://codeforces.com/problemset/problem/1932/A | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34019
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1931-G | codeforces | 1931-G | One-Dimensional Puzzle | https://codeforces.com/problemset/problem/1931/G | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3696
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1931-F | codeforces | 1931-F | Chat Screenshots | https://codeforces.com/problemset/problem/1931/F | [
"combinatorics",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12143
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1931-E | codeforces | 1931-E | Anna and the Valentine's Day Gift | https://codeforces.com/problemset/problem/1931/E | [
"games",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 26200
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1931-D | codeforces | 1931-D | Divisible Pairs | https://codeforces.com/problemset/problem/1931/D | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 31237
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1931-C | codeforces | 1931-C | Make Equal Again | https://codeforces.com/problemset/problem/1931/C | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34018
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1931-B | codeforces | 1931-B | Make Equal | https://codeforces.com/problemset/problem/1931/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35454
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1931-A | codeforces | 1931-A | Recovering a Small String | https://codeforces.com/problemset/problem/1931/A | [
"brute force",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40072
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1930-I | codeforces | 1930-I | Counting Is Fun | https://codeforces.com/problemset/problem/1930/I | [
"combinatorics"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 104
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1930-H | codeforces | 1930-H | Interactive Mex Tree | https://codeforces.com/problemset/problem/1930/H | [
"constructive algorithms",
"dfs and similar",
"interactive",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 366
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1930-G | codeforces | 1930-G | Prefix Max Set Counting | https://codeforces.com/problemset/problem/1930/G | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 514
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1930-F | codeforces | 1930-F | Maximize the Difference | https://codeforces.com/problemset/problem/1930/F | [
"bitmasks",
"brute force",
"dfs and similar"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 939
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1930-E | codeforces | 1930-E | 2..3...4.... Wonderful! Wonderful! | https://codeforces.com/problemset/problem/1930/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1480
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1930-D2 | codeforces | 1930-D2 | Sum over all Substrings (Hard Version) | https://codeforces.com/problemset/problem/1930/D2 | [
"bitmasks",
"divide and conquer",
"dp",
"dsu",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3065
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1930-D1 | codeforces | 1930-D1 | Sum over all Substrings (Easy Version) | https://codeforces.com/problemset/problem/1930/D1 | [
"brute force",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4878
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1930-C | codeforces | 1930-C | Lexicographically Largest | https://codeforces.com/problemset/problem/1930/C | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8180
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1930-B | codeforces | 1930-B | Permutation Printing | https://codeforces.com/problemset/problem/1930/B | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17717
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1930-A | codeforces | 1930-A | Maximise The Score | https://codeforces.com/problemset/problem/1930/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20313
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1929-F | codeforces | 1929-F | Sasha and the Wedding Binary Search Tree | https://codeforces.com/problemset/problem/1929/F | [
"brute force",
"combinatorics",
"data structures",
"dfs and similar",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2292
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1929-E | codeforces | 1929-E | Sasha and the Happy Tree Cutting | https://codeforces.com/problemset/problem/1929/E | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"graphs",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2090
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1929-D | codeforces | 1929-D | Sasha and a Walk in the City | https://codeforces.com/problemset/problem/1929/D | [
"combinatorics",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5801
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1929-C | codeforces | 1929-C | Sasha and the Casino | https://codeforces.com/problemset/problem/1929/C | [
"binary search",
"brute force",
"constructive algorithms",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1929-B | codeforces | 1929-B | Sasha and the Drawing | https://codeforces.com/problemset/problem/1929/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26764
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1929-A | codeforces | 1929-A | Sasha and the Beautiful Array | https://codeforces.com/problemset/problem/1929/A | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35059
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1928-F | codeforces | 1928-F | Digital Patterns | https://codeforces.com/problemset/problem/1928/F | [
"combinatorics",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 347
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1928-E | codeforces | 1928-E | Modular Sequence | https://codeforces.com/problemset/problem/1928/E | [
"brute force",
"constructive algorithms",
"dp",
"graphs",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2121
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1928-D | codeforces | 1928-D | Lonely Mountain Dungeons | https://codeforces.com/problemset/problem/1928/D | [
"brute force",
"data structures",
"greedy",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5186
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1928-C | codeforces | 1928-C | Physical Education Lesson | https://codeforces.com/problemset/problem/1928/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10409
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1928-B | codeforces | 1928-B | Equalize | https://codeforces.com/problemset/problem/1928/B | [
"binary search",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20835
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1928-A | codeforces | 1928-A | Rectangle Cutting | https://codeforces.com/problemset/problem/1928/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24465
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1927-G | codeforces | 1927-G | Paint Charges | https://codeforces.com/problemset/problem/1927/G | [
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2005
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1927-F | codeforces | 1927-F | Microcycle | https://codeforces.com/problemset/problem/1927/F | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5436
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1927-E | codeforces | 1927-E | Klever Permutation | https://codeforces.com/problemset/problem/1927/E | [
"constructive algorithms",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17132
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1927-D | codeforces | 1927-D | Find the Different Ones! | https://codeforces.com/problemset/problem/1927/D | [
"binary search",
"brute force",
"data structures",
"dp",
"dsu",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 33725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1927-C | codeforces | 1927-C | Choose the Different Ones! | https://codeforces.com/problemset/problem/1927/C | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 31663
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1927-B | codeforces | 1927-B | Following the String | https://codeforces.com/problemset/problem/1927/B | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 38286
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1927-A | codeforces | 1927-A | Make it White | https://codeforces.com/problemset/problem/1927/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 51663
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1926-G | codeforces | 1926-G | Vlad and Trouble at MIT | https://codeforces.com/problemset/problem/1926/G | [
"dfs and similar",
"dp",
"flows",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4571
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1926-F | codeforces | 1926-F | Vlad and Avoiding X | https://codeforces.com/problemset/problem/1926/F | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2100
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1926-E | codeforces | 1926-E | Vlad and an Odd Ordering | https://codeforces.com/problemset/problem/1926/E | [
"binary search",
"bitmasks",
"data structures",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14940
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1926-D | codeforces | 1926-D | Vlad and Division | https://codeforces.com/problemset/problem/1926/D | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18448
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1926-C | codeforces | 1926-C | Vlad and a Sum of Sum of Digits | https://codeforces.com/problemset/problem/1926/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 32953
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1926-B | codeforces | 1926-B | Vlad and Shapes | https://codeforces.com/problemset/problem/1926/B | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1926-A | codeforces | 1926-A | Vlad and the Best of Five | https://codeforces.com/problemset/problem/1926/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 62580
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1925-D | codeforces | 1925-D | Good Trip | https://codeforces.com/problemset/problem/1925/D | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4816
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1925-B | codeforces | 1925-B | A Balanced Problemset? | https://codeforces.com/problemset/problem/1925/B | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23212
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1925-A | codeforces | 1925-A | We Got Everything Covered! | https://codeforces.com/problemset/problem/1925/A | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31215
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1924-F | codeforces | 1924-F | Anti-Proxy Attendance | https://codeforces.com/problemset/problem/1924/F | [
"constructive algorithms",
"dp",
"interactive",
"ternary search"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 228
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1924-E | codeforces | 1924-E | Paper Cutting Again | https://codeforces.com/problemset/problem/1924/E | [
"combinatorics",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 540
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1924-D | codeforces | 1924-D | Balanced Subsequences | https://codeforces.com/problemset/problem/1924/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1439
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1924-C | codeforces | 1924-C | Fractal Origami | https://codeforces.com/problemset/problem/1924/C | [
"geometry",
"math",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1386
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1924-B | codeforces | 1924-B | Space Harbour | https://codeforces.com/problemset/problem/1924/B | [
"data structures",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3304
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1924-A | codeforces | 1924-A | Did We Get Everything Covered? | https://codeforces.com/problemset/problem/1924/A | [
"constructive algorithms",
"dp",
"greedy",
"shortest paths",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16822
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1923-F | codeforces | 1923-F | Shrink-Reverse | https://codeforces.com/problemset/problem/1923/F | [
"binary search",
"brute force",
"greedy",
"hashing",
"implementation",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 536
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1923-E | codeforces | 1923-E | Count Paths | https://codeforces.com/problemset/problem/1923/E | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5186
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1923-D | codeforces | 1923-D | Slimes | https://codeforces.com/problemset/problem/1923/D | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8411
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1923-C | codeforces | 1923-C | Find B | https://codeforces.com/problemset/problem/1923/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18550
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1923-B | codeforces | 1923-B | Monsters Attack! | https://codeforces.com/problemset/problem/1923/B | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19952
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1923-A | codeforces | 1923-A | Moving Chips | https://codeforces.com/problemset/problem/1923/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26403
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1922-F | codeforces | 1922-F | Replace on Segment | https://codeforces.com/problemset/problem/1922/F | [
"dp",
"graph matchings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1753
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1922-E | codeforces | 1922-E | Increasing Subsequences | https://codeforces.com/problemset/problem/1922/E | [
"bitmasks",
"constructive algorithms",
"divide and conquer",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9124
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1922-D | codeforces | 1922-D | Berserk Monsters | https://codeforces.com/problemset/problem/1922/D | [
"brute force",
"data structures",
"dsu",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6801
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1922-C | codeforces | 1922-C | Closest Cities | https://codeforces.com/problemset/problem/1922/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22119
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1922-B | codeforces | 1922-B | Forming Triangles | https://codeforces.com/problemset/problem/1922/B | [
"combinatorics",
"constructive algorithms",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23450
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1922-A | codeforces | 1922-A | Tricky Template | https://codeforces.com/problemset/problem/1922/A | [
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28917
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.