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: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": 231
} | 2026-04-13T03:38:27.662191+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": 1912
} | 2026-04-13T03:38:27.662191+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": 27782
} | 2026-04-13T03:38:27.662191+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": 10110
} | 2026-04-13T03:38:27.662191+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": 14102
} | 2026-04-13T03:38:27.662191+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": 7975
} | 2026-04-13T03:38:27.662191+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": 13289
} | 2026-04-13T03:38:27.662191+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": 26481
} | 2026-04-13T03:38:27.662191+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": 35910
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1722-B | codeforces | 1722-B | Colourblindness | https://codeforces.com/problemset/problem/1722/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 56137
} | 2026-04-13T03:38:27.662191+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": 65161
} | 2026-04-13T03:38:27.662191+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": 512
} | 2026-04-13T03:38:27.662191+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": 2541
} | 2026-04-13T03:38:27.662191+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": 7658
} | 2026-04-13T03:38:27.662191+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": 14538
} | 2026-04-13T03:38:27.662191+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": 23851
} | 2026-04-13T03:38:27.662191+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": 28269
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1720-E | codeforces | 1720-E | Misha and Paintings | https://codeforces.com/problemset/problem/1720/E | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 947
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1720-D2 | codeforces | 1720-D2 | Xor-Subsequence (hard version) | https://codeforces.com/problemset/problem/1720/D2 | [
"bitmasks",
"data structures",
"dp",
"strings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2174
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1720-D1 | codeforces | 1720-D1 | Xor-Subsequence (easy version) | https://codeforces.com/problemset/problem/1720/D1 | [
"bitmasks",
"brute force",
"dp",
"strings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6690
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1720-C | codeforces | 1720-C | Corners | https://codeforces.com/problemset/problem/1720/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18198
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1720-B | codeforces | 1720-B | Interesting Sum | https://codeforces.com/problemset/problem/1720/B | [
"brute force",
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22389
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1720-A | codeforces | 1720-A | Burenka Plays with Fractions | https://codeforces.com/problemset/problem/1720/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24316
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1719-C | codeforces | 1719-C | Fighting Tournament | https://codeforces.com/problemset/problem/1719/C | [
"binary search",
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14345
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1719-B | codeforces | 1719-B | Mathematical Circus | https://codeforces.com/problemset/problem/1719/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19157
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1719-A | codeforces | 1719-A | Chip Game | https://codeforces.com/problemset/problem/1719/A | [
"games",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26783
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1718-F | codeforces | 1718-F | Burenka, an Array and Queries | https://codeforces.com/problemset/problem/1718/F | [
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 217
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1718-E | codeforces | 1718-E | Impressionism | https://codeforces.com/problemset/problem/1718/E | [
"constructive algorithms",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 154
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1718-D | codeforces | 1718-D | Permutation for Burenka | https://codeforces.com/problemset/problem/1718/D | [
"data structures",
"graph matchings",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 412
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1718-C | codeforces | 1718-C | Tonya and Burenka-179 | https://codeforces.com/problemset/problem/1718/C | [
"data structures",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1846
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1718-B | codeforces | 1718-B | Fibonacci Strings | https://codeforces.com/problemset/problem/1718/B | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3439
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1718-A2 | codeforces | 1718-A2 | Burenka and Traditions (hard version) | https://codeforces.com/problemset/problem/1718/A2 | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5890
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1718-A1 | codeforces | 1718-A1 | Burenka and Traditions (easy version) | https://codeforces.com/problemset/problem/1718/A1 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6392
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1717-F | codeforces | 1717-F | Madoka and The First Session | https://codeforces.com/problemset/problem/1717/F | [
"constructive algorithms",
"flows",
"graph matchings",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 631
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1717-E | codeforces | 1717-E | Madoka and The Best University | https://codeforces.com/problemset/problem/1717/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3385
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1717-D | codeforces | 1717-D | Madoka and The Corruption Scheme | https://codeforces.com/problemset/problem/1717/D | [
"combinatorics",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4849
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1717-C | codeforces | 1717-C | Madoka and Formal Statement | https://codeforces.com/problemset/problem/1717/C | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15868
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1717-B | codeforces | 1717-B | Madoka and Underground Competitions | https://codeforces.com/problemset/problem/1717/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15618
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1717-A | codeforces | 1717-A | Madoka and Strange Thoughts | https://codeforces.com/problemset/problem/1717/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20925
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1716-F | codeforces | 1716-F | Bags with Balls | https://codeforces.com/problemset/problem/1716/F | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1358
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1716-E | codeforces | 1716-E | Swap and Maximum Block | https://codeforces.com/problemset/problem/1716/E | [
"bitmasks",
"data structures",
"dfs and similar",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1313
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1716-D | codeforces | 1716-D | Chip Move | https://codeforces.com/problemset/problem/1716/D | [
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6101
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1716-C | codeforces | 1716-C | Robot in a Hallway | https://codeforces.com/problemset/problem/1716/C | [
"data structures",
"dp",
"greedy",
"implementation",
"ternary search"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4569
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1716-B | codeforces | 1716-B | Permutation Chain | https://codeforces.com/problemset/problem/1716/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21941
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1716-A | codeforces | 1716-A | 2-3 Moves | https://codeforces.com/problemset/problem/1716/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35768
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1715-F | codeforces | 1715-F | Crop Squares | https://codeforces.com/problemset/problem/1715/F | [
"constructive algorithms",
"geometry",
"interactive",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 588
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1715-E | codeforces | 1715-E | Long Way Home | https://codeforces.com/problemset/problem/1715/E | [
"data structures",
"divide and conquer",
"dp",
"geometry",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2114
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1715-D | codeforces | 1715-D | 2+ doors | https://codeforces.com/problemset/problem/1715/D | [
"2-sat",
"bitmasks",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6053
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1715-C | codeforces | 1715-C | Monoblock | https://codeforces.com/problemset/problem/1715/C | [
"combinatorics",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10317
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1715-B | codeforces | 1715-B | Beautiful Array | https://codeforces.com/problemset/problem/1715/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 33274
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1715-A | codeforces | 1715-A | Crossmarket | https://codeforces.com/problemset/problem/1715/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24357
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1714-G | codeforces | 1714-G | Path Prefixes | https://codeforces.com/problemset/problem/1714/G | [
"binary search",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9630
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1714-F | codeforces | 1714-F | Build a Tree and That Is It | https://codeforces.com/problemset/problem/1714/F | [
"constructive algorithms",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3652
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1714-E | codeforces | 1714-E | Add Modulo 10 | https://codeforces.com/problemset/problem/1714/E | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 23336
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1714-D | codeforces | 1714-D | Color with Occurrences | https://codeforces.com/problemset/problem/1714/D | [
"brute force",
"data structures",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10292
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1714-C | codeforces | 1714-C | Minimum Varied Number | https://codeforces.com/problemset/problem/1714/C | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33371
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1714-B | codeforces | 1714-B | Remove Prefix | https://codeforces.com/problemset/problem/1714/B | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33577
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1714-A | codeforces | 1714-A | Everyone Loves to Sleep | https://codeforces.com/problemset/problem/1714/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 32789
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1713-F | codeforces | 1713-F | Lost Array | https://codeforces.com/problemset/problem/1713/F | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 679
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1713-E | codeforces | 1713-E | Cross Swapping | https://codeforces.com/problemset/problem/1713/E | [
"2-sat",
"data structures",
"dsu",
"greedy",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1963
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1713-D | codeforces | 1713-D | Tournament Countdown | https://codeforces.com/problemset/problem/1713/D | [
"constructive algorithms",
"greedy",
"interactive",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6218
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1713-C | codeforces | 1713-C | Build Permutation | https://codeforces.com/problemset/problem/1713/C | [
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18838
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1713-B | codeforces | 1713-B | Optimal Reduction | https://codeforces.com/problemset/problem/1713/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22662
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1713-A | codeforces | 1713-A | Traveling Salesman Problem | https://codeforces.com/problemset/problem/1713/A | [
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22800
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1712-F | codeforces | 1712-F | Triameter | https://codeforces.com/problemset/problem/1712/F | [
"binary search",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 443
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1712-E2 | codeforces | 1712-E2 | LCM Sum (hard version) | https://codeforces.com/problemset/problem/1712/E2 | [
"brute force",
"data structures",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1610
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1712-E1 | codeforces | 1712-E1 | LCM Sum (easy version) | https://codeforces.com/problemset/problem/1712/E1 | [
"binary search",
"brute force",
"combinatorics",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2455
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1712-D | codeforces | 1712-D | Empty Graph | https://codeforces.com/problemset/problem/1712/D | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5078
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1712-C | codeforces | 1712-C | Sort Zero | https://codeforces.com/problemset/problem/1712/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21237
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1712-B | codeforces | 1712-B | Woeful Permutation | https://codeforces.com/problemset/problem/1712/B | [
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22373
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1712-A | codeforces | 1712-A | Wonderful Permutation | https://codeforces.com/problemset/problem/1712/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25033
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1711-B | codeforces | 1711-B | Party | https://codeforces.com/problemset/problem/1711/B | [
"brute force",
"graphs"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14350
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1711-A | codeforces | 1711-A | Perfect Permutation | https://codeforces.com/problemset/problem/1711/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26432
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1710-E | codeforces | 1710-E | Two Arrays | https://codeforces.com/problemset/problem/1710/E | [
"binary search",
"games",
"graph matchings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 578
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1710-D | codeforces | 1710-D | Recover the Tree | https://codeforces.com/problemset/problem/1710/D | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 558
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1710-C | codeforces | 1710-C | XOR Triangle | https://codeforces.com/problemset/problem/1710/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1614
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1710-B | codeforces | 1710-B | Rain | https://codeforces.com/problemset/problem/1710/B | [
"binary search",
"brute force",
"data structures",
"geometry",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2778
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1710-A | codeforces | 1710-A | Color the Picture | https://codeforces.com/problemset/problem/1710/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11889
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1709-F | codeforces | 1709-F | Multiset of Strings | https://codeforces.com/problemset/problem/1709/F | [
"bitmasks",
"brute force",
"dp",
"fft",
"flows",
"graphs",
"math",
"meet-in-the-middle",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 676
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1709-E | codeforces | 1709-E | XOR Tree | https://codeforces.com/problemset/problem/1709/E | [
"bitmasks",
"data structures",
"dfs and similar",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3921
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1709-D | codeforces | 1709-D | Rorororobot | https://codeforces.com/problemset/problem/1709/D | [
"binary search",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10150
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1709-C | codeforces | 1709-C | Recover an RBS | https://codeforces.com/problemset/problem/1709/C | [
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10234
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1709-B | codeforces | 1709-B | Also Try Minecraft | https://codeforces.com/problemset/problem/1709/B | [
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25767
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1709-A | codeforces | 1709-A | Three Doors | https://codeforces.com/problemset/problem/1709/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31552
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1708-B | codeforces | 1708-B | Difference of GCDs | https://codeforces.com/problemset/problem/1708/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28169
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1708-A | codeforces | 1708-A | Difference Operations | https://codeforces.com/problemset/problem/1708/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22558
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1707-F | codeforces | 1707-F | Bugaboo | https://codeforces.com/problemset/problem/1707/F | [
"bitmasks",
"constructive algorithms",
"dp",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 174
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1707-E | codeforces | 1707-E | Replace | https://codeforces.com/problemset/problem/1707/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 931
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1707-D | codeforces | 1707-D | Partial Virtual Trees | https://codeforces.com/problemset/problem/1707/D | [
"combinatorics",
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 887
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1707-C | codeforces | 1707-C | DFS Trees | https://codeforces.com/problemset/problem/1707/C | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1889
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1707-B | codeforces | 1707-B | Difference Array | https://codeforces.com/problemset/problem/1707/B | [
"brute force",
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6376
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1707-A | codeforces | 1707-A | Doremy's IQ | https://codeforces.com/problemset/problem/1707/A | [
"binary search",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15400
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1706-E | codeforces | 1706-E | Qpwoeirut and Vertices | https://codeforces.com/problemset/problem/1706/E | [
"binary search",
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3673
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1706-D2 | codeforces | 1706-D2 | Chopping Carrots (Hard Version) | https://codeforces.com/problemset/problem/1706/D2 | [
"brute force",
"constructive algorithms",
"data structures",
"dp",
"greedy",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1933
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1706-D1 | codeforces | 1706-D1 | Chopping Carrots (Easy Version) | https://codeforces.com/problemset/problem/1706/D1 | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7702
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1706-C | codeforces | 1706-C | Qpwoeirut And The City | https://codeforces.com/problemset/problem/1706/C | [
"dp",
"flows",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16112
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1706-B | codeforces | 1706-B | Making Towers | https://codeforces.com/problemset/problem/1706/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17470
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1706-A | codeforces | 1706-A | Another String Minimization Problem | https://codeforces.com/problemset/problem/1706/A | [
"2-sat",
"constructive algorithms",
"greedy",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24229
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1705-F | codeforces | 1705-F | Mark and the Online Exam | https://codeforces.com/problemset/problem/1705/F | [
"bitmasks",
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 690
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1705-E | codeforces | 1705-E | Mark and Professor Koro | https://codeforces.com/problemset/problem/1705/E | [
"binary search",
"bitmasks",
"brute force",
"combinatorics",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2441
} | 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.