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: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": 1065
} | 2026-04-13T03:38:27.662191+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": 5022
} | 2026-04-13T03:38:27.662191+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": 9046
} | 2026-04-13T03:38:27.662191+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": 12296
} | 2026-04-13T03:38:27.662191+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": 14341
} | 2026-04-13T03:38:27.662191+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": 23092
} | 2026-04-13T03:38:27.662191+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": 632
} | 2026-04-13T03:38:27.662191+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": 1453
} | 2026-04-13T03:38:27.662191+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": 6209
} | 2026-04-13T03:38:27.662191+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": 10067
} | 2026-04-13T03:38:27.662191+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": 24394
} | 2026-04-13T03:38:27.662191+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": 23734
} | 2026-04-13T03:38:27.662191+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": 272
} | 2026-04-13T03:38:27.662191+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": 548
} | 2026-04-13T03:38:27.662191+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": 1372
} | 2026-04-13T03:38:27.662191+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": 1792
} | 2026-04-13T03:38:27.662191+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": 3739
} | 2026-04-13T03:38:27.662191+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": 12730
} | 2026-04-13T03:38:27.662191+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": 18698
} | 2026-04-13T03:38:27.662191+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": 14176
} | 2026-04-13T03:38:27.662191+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-04-13T03:38:27.662191+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": 157
} | 2026-04-13T03:38:27.662191+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": 1074
} | 2026-04-13T03:38:27.662191+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": 2101
} | 2026-04-13T03:38:27.662191+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": 6398
} | 2026-04-13T03:38:27.662191+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": 10156
} | 2026-04-13T03:38:27.662191+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": 10827
} | 2026-04-13T03:38:27.662191+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": 855
} | 2026-04-13T03:38:27.662191+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": 2760
} | 2026-04-13T03:38:27.662191+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": 1463
} | 2026-04-13T03:38:27.662191+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": 16477
} | 2026-04-13T03:38:27.662191+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": 20146
} | 2026-04-13T03:38:27.662191+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": 24113
} | 2026-04-13T03:38:27.662191+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": 253
} | 2026-04-13T03:38:27.662191+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": 1235
} | 2026-04-13T03:38:27.662191+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": 6724
} | 2026-04-13T03:38:27.662191+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": 10899
} | 2026-04-13T03:38:27.662191+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": 19284
} | 2026-04-13T03:38:27.662191+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": 21040
} | 2026-04-13T03:38:27.662191+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": 965
} | 2026-04-13T03:38:27.662191+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": 3234
} | 2026-04-13T03:38:27.662191+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": 7027
} | 2026-04-13T03:38:27.662191+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": 28333
} | 2026-04-13T03:38:27.662191+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": 16385
} | 2026-04-13T03:38:27.662191+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": 22389
} | 2026-04-13T03:38:27.662191+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": 1479
} | 2026-04-13T03:38:27.662191+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": 4721
} | 2026-04-13T03:38:27.662191+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": 14995
} | 2026-04-13T03:38:27.662191+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": 17032
} | 2026-04-13T03:38:27.662191+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": 21052
} | 2026-04-13T03:38:27.662191+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": 21838
} | 2026-04-13T03:38:27.662191+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": 576
} | 2026-04-13T03:38:27.662191+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": 1586
} | 2026-04-13T03:38:27.662191+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": 9863
} | 2026-04-13T03:38:27.662191+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": 3053
} | 2026-04-13T03:38:27.662191+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": 7504
} | 2026-04-13T03:38:27.662191+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": 17200
} | 2026-04-13T03:38:27.662191+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": 17487
} | 2026-04-13T03:38:27.662191+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": 830
} | 2026-04-13T03:38:27.662191+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": 3457
} | 2026-04-13T03:38:27.662191+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": 8440
} | 2026-04-13T03:38:27.662191+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": 12037
} | 2026-04-13T03:38:27.662191+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": 26554
} | 2026-04-13T03:38:27.662191+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": 23647
} | 2026-04-13T03:38:27.662191+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": 738
} | 2026-04-13T03:38:27.662191+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": 764
} | 2026-04-13T03:38:27.662191+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": 3016
} | 2026-04-13T03:38:27.662191+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": 17904
} | 2026-04-13T03:38:27.662191+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": 17098
} | 2026-04-13T03:38:27.662191+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": 24752
} | 2026-04-13T03:38:27.662191+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": 2495
} | 2026-04-13T03:38:27.662191+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": 4532
} | 2026-04-13T03:38:27.662191+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": 7892
} | 2026-04-13T03:38:27.662191+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": 30440
} | 2026-04-13T03:38:27.662191+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": 21597
} | 2026-04-13T03:38:27.662191+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": 32429
} | 2026-04-13T03:38:27.662191+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": 45771
} | 2026-04-13T03:38:27.662191+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": 611
} | 2026-04-13T03:38:27.662191+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": 506
} | 2026-04-13T03:38:27.662191+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": 2023
} | 2026-04-13T03:38:27.662191+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": 8223
} | 2026-04-13T03:38:27.662191+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": 17822
} | 2026-04-13T03:38:27.662191+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": 20664
} | 2026-04-13T03:38:27.662191+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": 25428
} | 2026-04-13T03:38:27.662191+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": 105
} | 2026-04-13T03:38:27.662191+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": 360
} | 2026-04-13T03:38:27.662191+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": 1700
} | 2026-04-13T03:38:27.662191+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": 4140
} | 2026-04-13T03:38:27.662191+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": 13381
} | 2026-04-13T03:38:27.662191+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": 16790
} | 2026-04-13T03:38:27.662191+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": 36141
} | 2026-04-13T03:38:27.662191+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": 4340
} | 2026-04-13T03:38:27.662191+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": 1087
} | 2026-04-13T03:38:27.662191+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": 775
} | 2026-04-13T03:38:27.662191+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": 462
} | 2026-04-13T03:38:27.662191+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": 294
} | 2026-04-13T03:38:27.662191+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": 3003
} | 2026-04-13T03:38:27.662191+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": 6677
} | 2026-04-13T03:38:27.662191+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": 1138
} | 2026-04-13T03:38:27.662191+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": 593
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.