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:1742-F | codeforces | 1742-F | Smaller | https://codeforces.com/problemset/problem/1742/F | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14348
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1742-E | codeforces | 1742-E | Scuza | https://codeforces.com/problemset/problem/1742/E | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 41461
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1742-D | codeforces | 1742-D | Coprime | https://codeforces.com/problemset/problem/1742/D | [
"brute force",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 36291
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1742-C | codeforces | 1742-C | Stripes | https://codeforces.com/problemset/problem/1742/C | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 40920
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1742-B | codeforces | 1742-B | Increasing | https://codeforces.com/problemset/problem/1742/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 62870
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1742-A | codeforces | 1742-A | Sum | https://codeforces.com/problemset/problem/1742/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 108819
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1741-G | codeforces | 1741-G | Kirill and Company | https://codeforces.com/problemset/problem/1741/G | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1989
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1741-F | codeforces | 1741-F | Multi-Colored Segments | https://codeforces.com/problemset/problem/1741/F | [
"binary search",
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2986
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1741-E | codeforces | 1741-E | Sending a Sequence Over the Network | https://codeforces.com/problemset/problem/1741/E | [
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18745
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1741-D | codeforces | 1741-D | Masha and a Beautiful Tree | https://codeforces.com/problemset/problem/1741/D | [
"dfs and similar",
"divide and conquer",
"graphs",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18734
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1741-C | codeforces | 1741-C | Minimize the Thickness | https://codeforces.com/problemset/problem/1741/C | [
"brute force",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19589
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1741-B | codeforces | 1741-B | Funny Permutation | https://codeforces.com/problemset/problem/1741/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26907
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1741-A | codeforces | 1741-A | Compare T-Shirt Sizes | https://codeforces.com/problemset/problem/1741/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34046
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1740-I | codeforces | 1740-I | Arranging Crystal Balls | https://codeforces.com/problemset/problem/1740/I | [
"data structures",
"divide and conquer",
"dp",
"geometry",
"graphs",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 320
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1740-H | codeforces | 1740-H | MEX Tree Manipulation | https://codeforces.com/problemset/problem/1740/H | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 504
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1740-G | codeforces | 1740-G | Dangerous Laser Power | https://codeforces.com/problemset/problem/1740/G | [
"constructive algorithms",
"dsu",
"sortings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 419
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1740-F | codeforces | 1740-F | Conditional Mix | https://codeforces.com/problemset/problem/1740/F | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1156
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1740-E | codeforces | 1740-E | Hanging Hearts | https://codeforces.com/problemset/problem/1740/E | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5146
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1740-D | codeforces | 1740-D | Knowledge Cards | https://codeforces.com/problemset/problem/1740/D | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9168
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1740-C | codeforces | 1740-C | Bricks and Bags | https://codeforces.com/problemset/problem/1740/C | [
"constructive algorithms",
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12449
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1740-B | codeforces | 1740-B | Jumbo Extra Cheese 2 | https://codeforces.com/problemset/problem/1740/B | [
"geometry",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14392
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1740-A | codeforces | 1740-A | Factorise N+M | https://codeforces.com/problemset/problem/1740/A | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23422
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1739-F | codeforces | 1739-F | Keyboard Design | https://codeforces.com/problemset/problem/1739/F | [
"bitmasks",
"data structures",
"dp",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 679
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1739-E | codeforces | 1739-E | Cleaning Robot | https://codeforces.com/problemset/problem/1739/E | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1514
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1739-D | codeforces | 1739-D | Reset K Edges | https://codeforces.com/problemset/problem/1739/D | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6493
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1739-C | codeforces | 1739-C | Card Game | https://codeforces.com/problemset/problem/1739/C | [
"combinatorics",
"constructive algorithms",
"dp",
"games"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10224
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1739-B | codeforces | 1739-B | Array Recovery | https://codeforces.com/problemset/problem/1739/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24668
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1739-A | codeforces | 1739-A | Immobile Knight | https://codeforces.com/problemset/problem/1739/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23898
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1738-H | codeforces | 1738-H | Palindrome Addicts | https://codeforces.com/problemset/problem/1738/H | [
"data structures",
"strings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 321
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1738-G | codeforces | 1738-G | Anti-Increasing Addicts | https://codeforces.com/problemset/problem/1738/G | [
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 578
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1738-F | codeforces | 1738-F | Connectivity Addicts | https://codeforces.com/problemset/problem/1738/F | [
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"interactive",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1416
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1738-E | codeforces | 1738-E | Balance Addicts | https://codeforces.com/problemset/problem/1738/E | [
"combinatorics",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1866
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1738-D | codeforces | 1738-D | Permutation Addicts | https://codeforces.com/problemset/problem/1738/D | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3782
} | 2026-08-10T02:20:32.917453+00:00 |
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": 13019
} | 2026-08-10T02:20:32.917453+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": 19128
} | 2026-08-10T02:20:32.917453+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": 14242
} | 2026-08-10T02:20:32.917453+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": 188
} | 2026-08-10T02:20:32.917453+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": 166
} | 2026-08-10T02:20:32.917453+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": 1136
} | 2026-08-10T02:20:32.917453+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": 2132
} | 2026-08-10T02:20:32.917453+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": 6485
} | 2026-08-10T02:20:32.917453+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": 10255
} | 2026-08-10T02:20:32.917453+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": 10980
} | 2026-08-10T02:20:32.917453+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": 907
} | 2026-08-10T02:20:32.917453+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": 2815
} | 2026-08-10T02:20:32.917453+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": 1499
} | 2026-08-10T02:20:32.917453+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": 16666
} | 2026-08-10T02:20:32.917453+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": 20612
} | 2026-08-10T02:20:32.917453+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": 24276
} | 2026-08-10T02:20:32.917453+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": 265
} | 2026-08-10T02:20:32.917453+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": 1270
} | 2026-08-10T02:20:32.917453+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": 7110
} | 2026-08-10T02:20:32.917453+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": 11054
} | 2026-08-10T02:20:32.917453+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": 19573
} | 2026-08-10T02:20:32.917453+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": 21136
} | 2026-08-10T02:20:32.917453+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": 1023
} | 2026-08-10T02:20:32.917453+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": 3323
} | 2026-08-10T02:20:32.917453+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": 7142
} | 2026-08-10T02:20:32.917453+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": 30635
} | 2026-08-10T02:20:32.917453+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": 16462
} | 2026-08-10T02:20:32.917453+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": 22514
} | 2026-08-10T02:20:32.917453+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": 1650
} | 2026-08-10T02:20:32.917453+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": 4831
} | 2026-08-10T02:20:32.917453+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": 15181
} | 2026-08-10T02:20:32.917453+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": 17232
} | 2026-08-10T02:20:32.917453+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": 21312
} | 2026-08-10T02:20:32.917453+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": 21949
} | 2026-08-10T02:20:32.917453+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": 607
} | 2026-08-10T02:20:32.917453+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": 1613
} | 2026-08-10T02:20:32.917453+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": 10057
} | 2026-08-10T02:20:32.917453+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": 3162
} | 2026-08-10T02:20:32.917453+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": 7957
} | 2026-08-10T02:20:32.917453+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": 17578
} | 2026-08-10T02:20:32.917453+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": 17846
} | 2026-08-10T02:20:32.917453+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": 928
} | 2026-08-10T02:20:32.917453+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": 3572
} | 2026-08-10T02:20:32.917453+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": 8673
} | 2026-08-10T02:20:32.917453+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": 12571
} | 2026-08-10T02:20:32.917453+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": 28547
} | 2026-08-10T02:20:32.917453+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": 23755
} | 2026-08-10T02:20:32.917453+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": 793
} | 2026-08-10T02:20:32.917453+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": 817
} | 2026-08-10T02:20:32.917453+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": 3083
} | 2026-08-10T02:20:32.917453+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": 18074
} | 2026-08-10T02:20:32.917453+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": 18119
} | 2026-08-10T02:20:32.917453+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": 25018
} | 2026-08-10T02:20:32.917453+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": 2600
} | 2026-08-10T02:20:32.917453+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": 4612
} | 2026-08-10T02:20:32.917453+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": 8071
} | 2026-08-10T02:20:32.917453+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": 32796
} | 2026-08-10T02:20:32.917453+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": 21785
} | 2026-08-10T02:20:32.917453+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": 32701
} | 2026-08-10T02:20:32.917453+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": 46496
} | 2026-08-10T02:20:32.917453+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": 672
} | 2026-08-10T02:20:32.917453+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": 519
} | 2026-08-10T02:20:32.917453+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": 2082
} | 2026-08-10T02:20:32.917453+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": 8382
} | 2026-08-10T02:20:32.917453+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": 18133
} | 2026-08-10T02:20:32.917453+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": 20718
} | 2026-08-10T02:20:32.917453+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": 25526
} | 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.