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: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": 17362
} | 2026-08-10T02:20:32.917453+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": 35551
} | 2026-08-10T02:20:32.917453+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": 31988
} | 2026-08-10T02:20:32.917453+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": 38696
} | 2026-08-10T02:20:32.917453+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": 52285
} | 2026-08-10T02:20:32.917453+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": 4669
} | 2026-08-10T02:20:32.917453+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": 2150
} | 2026-08-10T02:20:32.917453+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": 15224
} | 2026-08-10T02:20:32.917453+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": 18719
} | 2026-08-10T02:20:32.917453+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": 33529
} | 2026-08-10T02:20:32.917453+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": 36824
} | 2026-08-10T02:20:32.917453+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": 63749
} | 2026-08-10T02:20:32.917453+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": 4958
} | 2026-08-10T02:20:32.917453+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": 23727
} | 2026-08-10T02:20:32.917453+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": 31357
} | 2026-08-10T02:20:32.917453+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": 239
} | 2026-08-10T02:20:32.917453+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": 646
} | 2026-08-10T02:20:32.917453+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": 1539
} | 2026-08-10T02:20:32.917453+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": 1408
} | 2026-08-10T02:20:32.917453+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": 3384
} | 2026-08-10T02:20:32.917453+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": 17047
} | 2026-08-10T02:20:32.917453+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": 547
} | 2026-08-10T02:20:32.917453+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": 5357
} | 2026-08-10T02:20:32.917453+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": 8548
} | 2026-08-10T02:20:32.917453+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": 18884
} | 2026-08-10T02:20:32.917453+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": 20113
} | 2026-08-10T02:20:32.917453+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": 26505
} | 2026-08-10T02:20:32.917453+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": 1800
} | 2026-08-10T02:20:32.917453+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": 9289
} | 2026-08-10T02:20:32.917453+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": 6930
} | 2026-08-10T02:20:32.917453+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": 22438
} | 2026-08-10T02:20:32.917453+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": 23700
} | 2026-08-10T02:20:32.917453+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": 29036
} | 2026-08-10T02:20:32.917453+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": 1561
} | 2026-08-10T02:20:32.917453+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": 5263
} | 2026-08-10T02:20:32.917453+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": 11638
} | 2026-08-10T02:20:32.917453+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": 24738
} | 2026-08-10T02:20:32.917453+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": 33013
} | 2026-08-10T02:20:32.917453+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": 36830
} | 2026-08-10T02:20:32.917453+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": 50333
} | 2026-08-10T02:20:32.917453+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": 681
} | 2026-08-10T02:20:32.917453+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": 1300
} | 2026-08-10T02:20:32.917453+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": 3511
} | 2026-08-10T02:20:32.917453+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": 6724
} | 2026-08-10T02:20:32.917453+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": 21079
} | 2026-08-10T02:20:32.917453+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": 23449
} | 2026-08-10T02:20:32.917453+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": 29842
} | 2026-08-10T02:20:32.917453+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": 185
} | 2026-08-10T02:20:32.917453+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": 226
} | 2026-08-10T02:20:32.917453+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": 1228
} | 2026-08-10T02:20:32.917453+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": 2654
} | 2026-08-10T02:20:32.917453+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": 1174
} | 2026-08-10T02:20:32.917453+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": 4638
} | 2026-08-10T02:20:32.917453+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": 30453
} | 2026-08-10T02:20:32.917453+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": 31803
} | 2026-08-10T02:20:32.917453+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": 36459
} | 2026-08-10T02:20:32.917453+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": 709
} | 2026-08-10T02:20:32.917453+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": 1168
} | 2026-08-10T02:20:32.917453+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": 2202
} | 2026-08-10T02:20:32.917453+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": 6445
} | 2026-08-10T02:20:32.917453+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": 17154
} | 2026-08-10T02:20:32.917453+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": 27544
} | 2026-08-10T02:20:32.917453+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": 32591
} | 2026-08-10T02:20:32.917453+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": 1271
} | 2026-08-10T02:20:32.917453+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": 1686
} | 2026-08-10T02:20:32.917453+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": 2115
} | 2026-08-10T02:20:32.917453+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": 12615
} | 2026-08-10T02:20:32.917453+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": 39064
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1917-A | codeforces | 1917-A | Least Product | https://codeforces.com/problemset/problem/1917/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27453
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1916-H2 | codeforces | 1916-H2 | Matrix Rank (Hard Version) | https://codeforces.com/problemset/problem/1916/H2 | [
"combinatorics",
"dp",
"math",
"matrices",
"string suffix structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 681
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1916-H1 | codeforces | 1916-H1 | Matrix Rank (Easy Version) | https://codeforces.com/problemset/problem/1916/H1 | [
"brute force",
"combinatorics",
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 754
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1916-G | codeforces | 1916-G | Optimizations From Chelsu | https://codeforces.com/problemset/problem/1916/G | [
"divide and conquer",
"dp",
"number theory",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 239
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1916-F | codeforces | 1916-F | Group Division | https://codeforces.com/problemset/problem/1916/F | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 781
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1916-E | codeforces | 1916-E | Happy Life in University | https://codeforces.com/problemset/problem/1916/E | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2744
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1916-D | codeforces | 1916-D | Mathematical Problem | https://codeforces.com/problemset/problem/1916/D | [
"brute force",
"constructive algorithms",
"geometry",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9889
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1916-C | codeforces | 1916-C | Training Before the Olympiad | https://codeforces.com/problemset/problem/1916/C | [
"constructive algorithms",
"games",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20130
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1916-B | codeforces | 1916-B | Two Divisors | https://codeforces.com/problemset/problem/1916/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32872
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1916-A | codeforces | 1916-A | 2023 | https://codeforces.com/problemset/problem/1916/A | [
"constructive algorithms",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28522
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1915-G | codeforces | 1915-G | Bicycles | https://codeforces.com/problemset/problem/1915/G | [
"graphs",
"greedy",
"implementation",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10386
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1915-F | codeforces | 1915-F | Greetings | https://codeforces.com/problemset/problem/1915/F | [
"data structures",
"divide and conquer",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 23640
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1915-E | codeforces | 1915-E | Romantic Glasses | https://codeforces.com/problemset/problem/1915/E | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 37063
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1915-D | codeforces | 1915-D | Unnatural Language Processing | https://codeforces.com/problemset/problem/1915/D | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 35693
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1915-C | codeforces | 1915-C | Can I Square? | https://codeforces.com/problemset/problem/1915/C | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55838
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1915-B | codeforces | 1915-B | Not Quite Latin Square | https://codeforces.com/problemset/problem/1915/B | [
"bitmasks",
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 51379
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1915-A | codeforces | 1915-A | Odd One Out | https://codeforces.com/problemset/problem/1915/A | [
"bitmasks",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 82390
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1914-G2 | codeforces | 1914-G2 | Light Bulbs (Hard Version) | https://codeforces.com/problemset/problem/1914/G2 | [
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"graphs",
"hashing"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1896
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1914-G1 | codeforces | 1914-G1 | Light Bulbs (Easy Version) | https://codeforces.com/problemset/problem/1914/G1 | [
"brute force",
"combinatorics",
"dfs and similar",
"dp",
"dsu",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2473
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1914-F | codeforces | 1914-F | Programming Competition | https://codeforces.com/problemset/problem/1914/F | [
"dfs and similar",
"dp",
"graph matchings",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5126
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1914-E2 | codeforces | 1914-E2 | Game with Marbles (Hard Version) | https://codeforces.com/problemset/problem/1914/E2 | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15016
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1914-E1 | codeforces | 1914-E1 | Game with Marbles (Easy Version) | https://codeforces.com/problemset/problem/1914/E1 | [
"brute force",
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14487
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1914-D | codeforces | 1914-D | Three Activities | https://codeforces.com/problemset/problem/1914/D | [
"brute force",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 41156
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1914-C | codeforces | 1914-C | Quests | https://codeforces.com/problemset/problem/1914/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 42627
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1914-B | codeforces | 1914-B | Preparing for the Contest | https://codeforces.com/problemset/problem/1914/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33563
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1914-A | codeforces | 1914-A | Problemsolving Log | https://codeforces.com/problemset/problem/1914/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35617
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1913-F | codeforces | 1913-F | Palindromic Problem | https://codeforces.com/problemset/problem/1913/F | [
"binary search",
"data structures",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 610
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1913-E | codeforces | 1913-E | Matrix Problem | https://codeforces.com/problemset/problem/1913/E | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1376
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1913-D | codeforces | 1913-D | Array Collapse | https://codeforces.com/problemset/problem/1913/D | [
"data structures",
"divide and conquer",
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4278
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1913-C | codeforces | 1913-C | Game with Multiset | https://codeforces.com/problemset/problem/1913/C | [
"binary search",
"bitmasks",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17824
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1913-B | codeforces | 1913-B | Swap and Delete | https://codeforces.com/problemset/problem/1913/B | [
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 55916
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1913-A | codeforces | 1913-A | Rating Increase | https://codeforces.com/problemset/problem/1913/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27569
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.