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: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": 34954
} | 2026-11-02T05:37:07.883505+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": 3901
} | 2026-11-02T05:37:07.883505+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": 13162
} | 2026-11-02T05:37:07.883505+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": 29006
} | 2026-11-02T05:37:07.883505+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": 34589
} | 2026-11-02T05:37:07.883505+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": 34725
} | 2026-11-02T05:37:07.883505+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": 36084
} | 2026-11-02T05:37:07.883505+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": 40625
} | 2026-11-02T05:37:07.883505+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": 116
} | 2026-11-02T05:37:07.883505+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": 420
} | 2026-11-02T05:37:07.883505+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": 553
} | 2026-11-02T05:37:07.883505+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": 998
} | 2026-11-02T05:37:07.883505+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": 1567
} | 2026-11-02T05:37:07.883505+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": 3178
} | 2026-11-02T05:37:07.883505+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": 4978
} | 2026-11-02T05:37:07.883505+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": 8353
} | 2026-11-02T05:37:07.883505+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": 18035
} | 2026-11-02T05:37:07.883505+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": 20601
} | 2026-11-02T05:37:07.883505+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": 2420
} | 2026-11-02T05:37:07.883505+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": 2201
} | 2026-11-02T05:37:07.883505+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": 6032
} | 2026-11-02T05:37:07.883505+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": 17796
} | 2026-11-02T05:37:07.883505+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": 27004
} | 2026-11-02T05:37:07.883505+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": 35709
} | 2026-11-02T05:37:07.883505+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": 519
} | 2026-11-02T05:37:07.883505+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": 2325
} | 2026-11-02T05:37:07.883505+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": 5345
} | 2026-11-02T05:37:07.883505+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": 10655
} | 2026-11-02T05:37:07.883505+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": 21519
} | 2026-11-02T05:37:07.883505+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": 24710
} | 2026-11-02T05:37:07.883505+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": 2157
} | 2026-11-02T05:37:07.883505+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": 5799
} | 2026-11-02T05:37:07.883505+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": 17561
} | 2026-11-02T05:37:07.883505+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": 37062
} | 2026-11-02T05:37:07.883505+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": 32230
} | 2026-11-02T05:37:07.883505+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": 39040
} | 2026-11-02T05:37:07.883505+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": 53101
} | 2026-11-02T05:37:07.883505+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": 4833
} | 2026-11-02T05:37:07.883505+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": 2203
} | 2026-11-02T05:37:07.883505+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": 15499
} | 2026-11-02T05:37:07.883505+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": 18977
} | 2026-11-02T05:37:07.883505+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": 34193
} | 2026-11-02T05:37:07.883505+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": 37190
} | 2026-11-02T05:37:07.883505+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": 65249
} | 2026-11-02T05:37:07.883505+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": 5140
} | 2026-11-02T05:37:07.883505+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": 23995
} | 2026-11-02T05:37:07.883505+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": 31566
} | 2026-11-02T05:37:07.883505+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": 241
} | 2026-11-02T05:37:07.883505+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": 656
} | 2026-11-02T05:37:07.883505+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": 1580
} | 2026-11-02T05:37:07.883505+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": 1424
} | 2026-11-02T05:37:07.883505+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": 3437
} | 2026-11-02T05:37:07.883505+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": 17273
} | 2026-11-02T05:37:07.883505+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": 552
} | 2026-11-02T05:37:07.883505+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": 5560
} | 2026-11-02T05:37:07.883505+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": 8670
} | 2026-11-02T05:37:07.883505+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": 19179
} | 2026-11-02T05:37:07.883505+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": 20215
} | 2026-11-02T05:37:07.883505+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": 26617
} | 2026-11-02T05:37:07.883505+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": 1889
} | 2026-11-02T05:37:07.883505+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": 9436
} | 2026-11-02T05:37:07.883505+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": 7128
} | 2026-11-02T05:37:07.883505+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": 22829
} | 2026-11-02T05:37:07.883505+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": 23958
} | 2026-11-02T05:37:07.883505+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": 29147
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1921-G | codeforces | 1921-G | Mischievous Shooter | https://codeforces.com/problemset/problem/1921/G | [
"brute force",
"data structures",
"divide and conquer",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1595
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1921-F | codeforces | 1921-F | Sum of Progression | https://codeforces.com/problemset/problem/1921/F | [
"brute force",
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5450
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1921-E | codeforces | 1921-E | Eat the Chip | https://codeforces.com/problemset/problem/1921/E | [
"brute force",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11755
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1921-D | codeforces | 1921-D | Very Different Array | https://codeforces.com/problemset/problem/1921/D | [
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24971
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1921-C | codeforces | 1921-C | Sending Messages | https://codeforces.com/problemset/problem/1921/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 33268
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1921-B | codeforces | 1921-B | Arranging Cats | https://codeforces.com/problemset/problem/1921/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37028
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1921-A | codeforces | 1921-A | Square | https://codeforces.com/problemset/problem/1921/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 50907
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1920-F2 | codeforces | 1920-F2 | Smooth Sailing (Hard Version) | https://codeforces.com/problemset/problem/1920/F2 | [
"binary search",
"data structures",
"dsu",
"geometry",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 712
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1920-F1 | codeforces | 1920-F1 | Smooth Sailing (Easy Version) | https://codeforces.com/problemset/problem/1920/F1 | [
"binary search",
"brute force",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1327
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1920-E | codeforces | 1920-E | Counting Binary Strings | https://codeforces.com/problemset/problem/1920/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3611
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1920-D | codeforces | 1920-D | Array Repetition | https://codeforces.com/problemset/problem/1920/D | [
"binary search",
"brute force",
"dsu",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6829
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1920-C | codeforces | 1920-C | Partitioning the Array | https://codeforces.com/problemset/problem/1920/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 21883
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1920-B | codeforces | 1920-B | Summation Game | https://codeforces.com/problemset/problem/1920/B | [
"games",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23665
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1920-A | codeforces | 1920-A | Satisfying Constraints | https://codeforces.com/problemset/problem/1920/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30017
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1919-H | codeforces | 1919-H | Tree Diameter | https://codeforces.com/problemset/problem/1919/H | [
"interactive",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 190
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1919-G | codeforces | 1919-G | Tree LGM | https://codeforces.com/problemset/problem/1919/G | [
"constructive algorithms",
"divide and conquer",
"games",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 236
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1919-F2 | codeforces | 1919-F2 | Wine Factory (Hard Version) | https://codeforces.com/problemset/problem/1919/F2 | [
"data structures",
"dp",
"flows",
"greedy",
"matrices"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1280
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1919-F1 | codeforces | 1919-F1 | Wine Factory (Easy Version) | https://codeforces.com/problemset/problem/1919/F1 | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2695
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1919-E | codeforces | 1919-E | Counting Prefixes | https://codeforces.com/problemset/problem/1919/E | [
"combinatorics",
"constructive algorithms",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1200
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1919-D | codeforces | 1919-D | 01 Tree | https://codeforces.com/problemset/problem/1919/D | [
"constructive algorithms",
"data structures",
"dsu",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4716
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1919-C | codeforces | 1919-C | Grouping Increases | https://codeforces.com/problemset/problem/1919/C | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 31769
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1919-B | codeforces | 1919-B | Plus-Minus Split | https://codeforces.com/problemset/problem/1919/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31901
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1919-A | codeforces | 1919-A | Wallet Exchange | https://codeforces.com/problemset/problem/1919/A | [
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36660
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1918-G | codeforces | 1918-G | Permutation of Given | https://codeforces.com/problemset/problem/1918/G | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 725
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1918-F | codeforces | 1918-F | Caterpillar on a Tree | https://codeforces.com/problemset/problem/1918/F | [
"dfs and similar",
"graphs",
"greedy",
"implementation",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1200
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1918-E | codeforces | 1918-E | ace5 and Task Order | https://codeforces.com/problemset/problem/1918/E | [
"constructive algorithms",
"divide and conquer",
"implementation",
"interactive",
"probabilities",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2269
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1918-D | codeforces | 1918-D | Blocking Elements | https://codeforces.com/problemset/problem/1918/D | [
"binary search",
"data structures",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6685
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1918-C | codeforces | 1918-C | XOR-distance | https://codeforces.com/problemset/problem/1918/C | [
"bitmasks",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17425
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1918-B | codeforces | 1918-B | Minimize Inversions | https://codeforces.com/problemset/problem/1918/B | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27793
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1918-A | codeforces | 1918-A | Brick Wall | https://codeforces.com/problemset/problem/1918/A | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32785
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1917-F | codeforces | 1917-F | Construct Tree | https://codeforces.com/problemset/problem/1917/F | [
"bitmasks",
"constructive algorithms",
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1293
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1917-E | codeforces | 1917-E | Construct Matrix | https://codeforces.com/problemset/problem/1917/E | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1729
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1917-D | codeforces | 1917-D | Yet Another Inversions Problem | https://codeforces.com/problemset/problem/1917/D | [
"combinatorics",
"data structures",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2151
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1917-C | codeforces | 1917-C | Watering an Array | https://codeforces.com/problemset/problem/1917/C | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12769
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1917-B | codeforces | 1917-B | Erase First or Second Letter | https://codeforces.com/problemset/problem/1917/B | [
"brute force",
"combinatorics",
"data structures",
"dp",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 41362
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.