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:1738-C | codeforces | 1738-C | Even Number Addicts | https://codeforces.com/problemset/problem/1738/C | [
"dp",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12865
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1738-B | codeforces | 1738-B | Prefix Sum Addicts | https://codeforces.com/problemset/problem/1738/B | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18877
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1738-A | codeforces | 1738-A | Glory Addicts | https://codeforces.com/problemset/problem/1738/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14204
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1737-G | codeforces | 1737-G | Ela Takes Dancing Class | https://codeforces.com/problemset/problem/1737/G | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 150
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1737-F | codeforces | 1737-F | Ela and Prime GCD | https://codeforces.com/problemset/problem/1737/F | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 159
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1737-E | codeforces | 1737-E | Ela Goes Hiking | https://codeforces.com/problemset/problem/1737/E | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1079
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1737-D | codeforces | 1737-D | Ela and the Wiring Wizard | https://codeforces.com/problemset/problem/1737/D | [
"brute force",
"dp",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2110
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1737-C | codeforces | 1737-C | Ela and Crickets | https://codeforces.com/problemset/problem/1737/C | [
"constructive algorithms",
"games",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6428
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1737-B | codeforces | 1737-B | Ela's Fitness and the Luxury Number | https://codeforces.com/problemset/problem/1737/B | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10202
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1737-A | codeforces | 1737-A | Ela Sorting Books | https://codeforces.com/problemset/problem/1737/A | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10863
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1736-E | codeforces | 1736-E | Swap and Take | https://codeforces.com/problemset/problem/1736/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 858
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1736-D | codeforces | 1736-D | Equal Binary Subsequences | https://codeforces.com/problemset/problem/1736/D | [
"constructive algorithms",
"geometry",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2787
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1736-C2 | codeforces | 1736-C2 | Good Subarrays (Hard Version) | https://codeforces.com/problemset/problem/1736/C2 | [
"binary search",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1472
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1736-C1 | codeforces | 1736-C1 | Good Subarrays (Easy Version) | https://codeforces.com/problemset/problem/1736/C1 | [
"binary search",
"data structures",
"schedules",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16560
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1736-B | codeforces | 1736-B | Playing with GCD | https://codeforces.com/problemset/problem/1736/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20441
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1736-A | codeforces | 1736-A | Make A Equal to B | https://codeforces.com/problemset/problem/1736/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24179
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1735-F | codeforces | 1735-F | Pebbles and Beads | https://codeforces.com/problemset/problem/1735/F | [
"data structures",
"geometry"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 255
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1735-E | codeforces | 1735-E | House Planning | https://codeforces.com/problemset/problem/1735/E | [
"constructive algorithms",
"data structures",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1735-D | codeforces | 1735-D | Meta-set | https://codeforces.com/problemset/problem/1735/D | [
"brute force",
"combinatorics",
"data structures",
"hashing",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6846
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1735-C | codeforces | 1735-C | Phase Shift | https://codeforces.com/problemset/problem/1735/C | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10968
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1735-B | codeforces | 1735-B | Tea with Tangerines | https://codeforces.com/problemset/problem/1735/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19401
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1735-A | codeforces | 1735-A | Working Week | https://codeforces.com/problemset/problem/1735/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21075
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1734-F | codeforces | 1734-F | Zeros and Ones | https://codeforces.com/problemset/problem/1734/F | [
"bitmasks",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1734-E | codeforces | 1734-E | Rectangular Congruence | https://codeforces.com/problemset/problem/1734/E | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3258
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1734-D | codeforces | 1734-D | Slime Escape | https://codeforces.com/problemset/problem/1734/D | [
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7068
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1734-C | codeforces | 1734-C | Removing Smallest Multiples | https://codeforces.com/problemset/problem/1734/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 29149
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1734-B | codeforces | 1734-B | Bright, Nice, Brilliant | https://codeforces.com/problemset/problem/1734/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16414
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1734-A | codeforces | 1734-A | Select Three Sticks | https://codeforces.com/problemset/problem/1734/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22425
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1733-E | codeforces | 1733-E | Conveyor | https://codeforces.com/problemset/problem/1733/E | [
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1489
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1733-D2 | codeforces | 1733-D2 | Zero-One (Hard Version) | https://codeforces.com/problemset/problem/1733/D2 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4759
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1733-D1 | codeforces | 1733-D1 | Zero-One (Easy Version) | https://codeforces.com/problemset/problem/1733/D1 | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15090
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1733-C | codeforces | 1733-C | Parity Shuffle Sorting | https://codeforces.com/problemset/problem/1733/C | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17135
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1733-B | codeforces | 1733-B | Rule of League | https://codeforces.com/problemset/problem/1733/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21149
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1733-A | codeforces | 1733-A | Consecutive Sum | https://codeforces.com/problemset/problem/1733/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21872
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1732-E | codeforces | 1732-E | Location | https://codeforces.com/problemset/problem/1732/E | [
"data structures",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 588
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1732-D2 | codeforces | 1732-D2 | Balance (Hard version) | https://codeforces.com/problemset/problem/1732/D2 | [
"brute force",
"data structures",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1596
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1732-D1 | codeforces | 1732-D1 | Balance (Easy version) | https://codeforces.com/problemset/problem/1732/D1 | [
"brute force",
"data structures",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9946
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1732-C2 | codeforces | 1732-C2 | Sheikh (Hard Version) | https://codeforces.com/problemset/problem/1732/C2 | [
"binary search",
"bitmasks",
"brute force",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3094
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1732-C1 | codeforces | 1732-C1 | Sheikh (Easy version) | https://codeforces.com/problemset/problem/1732/C1 | [
"binary search",
"bitmasks",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7740
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1732-B | codeforces | 1732-B | Ugu | https://codeforces.com/problemset/problem/1732/B | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17346
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1732-A | codeforces | 1732-A | Bestie | https://codeforces.com/problemset/problem/1732/A | [
"brute force",
"combinatorics",
"constructive algorithms",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17624
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1731-F | codeforces | 1731-F | Function Sum | https://codeforces.com/problemset/problem/1731/F | [
"brute force",
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 857
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1731-E | codeforces | 1731-E | Graph Cost | https://codeforces.com/problemset/problem/1731/E | [
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3498
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1731-D | codeforces | 1731-D | Valiant's New Map | https://codeforces.com/problemset/problem/1731/D | [
"binary search",
"brute force",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8554
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1731-C | codeforces | 1731-C | Even Subarrays | https://codeforces.com/problemset/problem/1731/C | [
"bitmasks",
"brute force",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12253
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1731-B | codeforces | 1731-B | Kill Demodogs | https://codeforces.com/problemset/problem/1731/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27233
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1731-A | codeforces | 1731-A | Joey Takes Money | https://codeforces.com/problemset/problem/1731/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23695
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1730-F | codeforces | 1730-F | Almost Sorted | https://codeforces.com/problemset/problem/1730/F | [
"bitmasks",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 747
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1730-E | codeforces | 1730-E | Maximums and Minimums | https://codeforces.com/problemset/problem/1730/E | [
"combinatorics",
"data structures",
"divide and conquer",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 772
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1730-D | codeforces | 1730-D | Prefixes and Suffixes | https://codeforces.com/problemset/problem/1730/D | [
"constructive algorithms",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3034
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1730-C | codeforces | 1730-C | Minimum Notation | https://codeforces.com/problemset/problem/1730/C | [
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17978
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1730-B | codeforces | 1730-B | Meeting on the Line | https://codeforces.com/problemset/problem/1730/B | [
"binary search",
"geometry",
"greedy",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 17502
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1730-A | codeforces | 1730-A | Planets | https://codeforces.com/problemset/problem/1730/A | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24860
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1729-G | codeforces | 1729-G | Cut Substrings | https://codeforces.com/problemset/problem/1729/G | [
"combinatorics",
"dp",
"hashing",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2525
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1729-F | codeforces | 1729-F | Kirei and the Linear Function | https://codeforces.com/problemset/problem/1729/F | [
"hashing",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4575
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1729-E | codeforces | 1729-E | Guess the Cycle Size | https://codeforces.com/problemset/problem/1729/E | [
"interactive",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7952
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1729-D | codeforces | 1729-D | Friends and the Restaurant | https://codeforces.com/problemset/problem/1729/D | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 31264
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1729-C | codeforces | 1729-C | Jumping on Tiles | https://codeforces.com/problemset/problem/1729/C | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1729-B | codeforces | 1729-B | Decode String | https://codeforces.com/problemset/problem/1729/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32531
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1729-A | codeforces | 1729-A | Two Elevators | https://codeforces.com/problemset/problem/1729/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 46054
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1728-G | codeforces | 1728-G | Illumination | https://codeforces.com/problemset/problem/1728/G | [
"binary search",
"bitmasks",
"brute force",
"combinatorics",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 622
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1728-F | codeforces | 1728-F | Fishermen | https://codeforces.com/problemset/problem/1728/F | [
"flows",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 510
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1728-E | codeforces | 1728-E | Red-Black Pepper | https://codeforces.com/problemset/problem/1728/E | [
"brute force",
"data structures",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2038
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1728-D | codeforces | 1728-D | Letter Picking | https://codeforces.com/problemset/problem/1728/D | [
"constructive algorithms",
"dp",
"games",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8267
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1728-C | codeforces | 1728-C | Digital Logarithm | https://codeforces.com/problemset/problem/1728/C | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17938
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1728-B | codeforces | 1728-B | Best Permutation | https://codeforces.com/problemset/problem/1728/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20684
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1728-A | codeforces | 1728-A | Colored Balls: Revisited | https://codeforces.com/problemset/problem/1728/A | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25476
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1726-H | codeforces | 1726-H | Mainak and the Bleeding Polygon | https://codeforces.com/problemset/problem/1726/H | [
"binary search",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 106
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1726-G | codeforces | 1726-G | A Certain Magical Party | https://codeforces.com/problemset/problem/1726/G | [
"combinatorics",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 367
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1726-E | codeforces | 1726-E | Almost Perfect | https://codeforces.com/problemset/problem/1726/E | [
"combinatorics",
"fft",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1726-D | codeforces | 1726-D | Edge Split | https://codeforces.com/problemset/problem/1726/D | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4173
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1726-C | codeforces | 1726-C | Jatayu's Balanced Bracket Sequence | https://codeforces.com/problemset/problem/1726/C | [
"data structures",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13423
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1726-B | codeforces | 1726-B | Mainak and Interesting Sequence | https://codeforces.com/problemset/problem/1726/B | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16895
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1726-A | codeforces | 1726-A | Mainak and Array | https://codeforces.com/problemset/problem/1726/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 37344
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-M | codeforces | 1725-M | Moving Both Hands | https://codeforces.com/problemset/problem/1725/M | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4471
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-L | codeforces | 1725-L | Lemper Cooking Competition | https://codeforces.com/problemset/problem/1725/L | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1108
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-K | codeforces | 1725-K | Kingdom of Criticism | https://codeforces.com/problemset/problem/1725/K | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 791
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-J | codeforces | 1725-J | Journey | https://codeforces.com/problemset/problem/1725/J | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 466
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-I | codeforces | 1725-I | Imitating the Key Tree | https://codeforces.com/problemset/problem/1725/I | [
"combinatorics",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 298
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-H | codeforces | 1725-H | Hot Black Hot White | https://codeforces.com/problemset/problem/1725/H | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3019
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-G | codeforces | 1725-G | Garage | https://codeforces.com/problemset/problem/1725/G | [
"binary search",
"geometry",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6730
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-F | codeforces | 1725-F | Field Photography | https://codeforces.com/problemset/problem/1725/F | [
"bitmasks",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1152
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-E | codeforces | 1725-E | Electrical Efficiency | https://codeforces.com/problemset/problem/1725/E | [
"combinatorics",
"data structures",
"dp",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 599
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-D | codeforces | 1725-D | Deducing Sortability | https://codeforces.com/problemset/problem/1725/D | [
"binary search",
"bitmasks",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 232
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-C | codeforces | 1725-C | Circular Mirror | https://codeforces.com/problemset/problem/1725/C | [
"binary search",
"combinatorics",
"geometry",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1955
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-B | codeforces | 1725-B | Basketball Together | https://codeforces.com/problemset/problem/1725/B | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29055
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1725-A | codeforces | 1725-A | Accumulation of Dominoes | https://codeforces.com/problemset/problem/1725/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10175
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1722-G | codeforces | 1722-G | Even-Odd XOR | https://codeforces.com/problemset/problem/1722/G | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14287
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1722-F | codeforces | 1722-F | L-shapes | https://codeforces.com/problemset/problem/1722/F | [
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8038
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1722-E | codeforces | 1722-E | Counting Rectangles | https://codeforces.com/problemset/problem/1722/E | [
"brute force",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13453
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1722-D | codeforces | 1722-D | Line | https://codeforces.com/problemset/problem/1722/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26623
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1722-C | codeforces | 1722-C | Word Game | https://codeforces.com/problemset/problem/1722/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36402
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1722-B | codeforces | 1722-B | Colourblindness | https://codeforces.com/problemset/problem/1722/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 56783
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1722-A | codeforces | 1722-A | Spell Check | https://codeforces.com/problemset/problem/1722/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 66169
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1721-F | codeforces | 1721-F | Matching Reduction | https://codeforces.com/problemset/problem/1721/F | [
"brute force",
"constructive algorithms",
"dfs and similar",
"flows",
"graph matchings",
"graphs",
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 514
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1721-E | codeforces | 1721-E | Prefix Function Queries | https://codeforces.com/problemset/problem/1721/E | [
"dfs and similar",
"dp",
"hashing",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2561
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1721-D | codeforces | 1721-D | Maximum AND | https://codeforces.com/problemset/problem/1721/D | [
"bitmasks",
"dfs and similar",
"divide and conquer",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7721
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1721-C | codeforces | 1721-C | Min-Max Array Transformation | https://codeforces.com/problemset/problem/1721/C | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14598
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1721-B | codeforces | 1721-B | Deadly Laser | https://codeforces.com/problemset/problem/1721/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 23917
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1721-A | codeforces | 1721-A | Image | https://codeforces.com/problemset/problem/1721/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28338
} | 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.