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: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": 953
} | 2026-06-01T05:00:40.145500+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": 2220
} | 2026-06-01T05:00:40.145500+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": 6723
} | 2026-06-01T05:00:40.145500+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": 18261
} | 2026-06-01T05:00:40.145500+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": 22440
} | 2026-06-01T05:00:40.145500+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": 24418
} | 2026-06-01T05:00:40.145500+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": 14406
} | 2026-06-01T05:00:40.145500+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": 19175
} | 2026-06-01T05:00:40.145500+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": 26861
} | 2026-06-01T05:00:40.145500+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": 218
} | 2026-06-01T05:00:40.145500+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": 180
} | 2026-06-01T05:00:40.145500+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": 420
} | 2026-06-01T05:00:40.145500+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": 1864
} | 2026-06-01T05:00:40.145500+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": 3484
} | 2026-06-01T05:00:40.145500+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": 5935
} | 2026-06-01T05:00:40.145500+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": 6435
} | 2026-06-01T05:00:40.145500+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": 640
} | 2026-06-01T05:00:40.145500+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": 3428
} | 2026-06-01T05:00:40.145500+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": 4888
} | 2026-06-01T05:00:40.145500+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": 15944
} | 2026-06-01T05:00:40.145500+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": 15656
} | 2026-06-01T05:00:40.145500+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": 21012
} | 2026-06-01T05:00:40.145500+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": 1383
} | 2026-06-01T05:00:40.145500+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": 1322
} | 2026-06-01T05:00:40.145500+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": 6161
} | 2026-06-01T05:00:40.145500+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": 4604
} | 2026-06-01T05:00:40.145500+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": 21965
} | 2026-06-01T05:00:40.145500+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": 36003
} | 2026-06-01T05:00:40.145500+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": 593
} | 2026-06-01T05:00:40.145500+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": 2151
} | 2026-06-01T05:00:40.145500+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": 6130
} | 2026-06-01T05:00:40.145500+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": 10444
} | 2026-06-01T05:00:40.145500+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": 34226
} | 2026-06-01T05:00:40.145500+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": 24393
} | 2026-06-01T05:00:40.145500+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": 9741
} | 2026-06-01T05:00:40.145500+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": 3693
} | 2026-06-01T05:00:40.145500+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": 23846
} | 2026-06-01T05:00:40.145500+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": 10373
} | 2026-06-01T05:00:40.145500+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": 33486
} | 2026-06-01T05:00:40.145500+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": 33929
} | 2026-06-01T05:00:40.145500+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": 33031
} | 2026-06-01T05:00:40.145500+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": 690
} | 2026-06-01T05:00:40.145500+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": 1989
} | 2026-06-01T05:00:40.145500+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": 6256
} | 2026-06-01T05:00:40.145500+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": 18919
} | 2026-06-01T05:00:40.145500+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": 22740
} | 2026-06-01T05:00:40.145500+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": 22849
} | 2026-06-01T05:00:40.145500+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-06-01T05:00:40.145500+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": 1618
} | 2026-06-01T05:00:40.145500+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": 2466
} | 2026-06-01T05:00:40.145500+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": 5124
} | 2026-06-01T05:00:40.145500+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": 21301
} | 2026-06-01T05:00:40.145500+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": 22411
} | 2026-06-01T05:00:40.145500+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": 25102
} | 2026-06-01T05:00:40.145500+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": 14411
} | 2026-06-01T05:00:40.145500+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": 26534
} | 2026-06-01T05:00:40.145500+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": 583
} | 2026-06-01T05:00:40.145500+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": 560
} | 2026-06-01T05:00:40.145500+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": 1631
} | 2026-06-01T05:00:40.145500+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": 2802
} | 2026-06-01T05:00:40.145500+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": 11941
} | 2026-06-01T05:00:40.145500+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": 683
} | 2026-06-01T05:00:40.145500+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": 3990
} | 2026-06-01T05:00:40.145500+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": 10308
} | 2026-06-01T05:00:40.145500+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": 10340
} | 2026-06-01T05:00:40.145500+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": 25986
} | 2026-06-01T05:00:40.145500+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": 31649
} | 2026-06-01T05:00:40.145500+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": 28836
} | 2026-06-01T05:00:40.145500+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": 22623
} | 2026-06-01T05:00:40.145500+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": 176
} | 2026-06-01T05:00:40.145500+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": 936
} | 2026-06-01T05:00:40.145500+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": 894
} | 2026-06-01T05:00:40.145500+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": 1924
} | 2026-06-01T05:00:40.145500+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": 6438
} | 2026-06-01T05:00:40.145500+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": 15518
} | 2026-06-01T05:00:40.145500+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": 3778
} | 2026-06-01T05:00:40.145500+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": 1943
} | 2026-06-01T05:00:40.145500+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": 7735
} | 2026-06-01T05:00:40.145500+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": 16171
} | 2026-06-01T05:00:40.145500+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": 17507
} | 2026-06-01T05:00:40.145500+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": 24276
} | 2026-06-01T05:00:40.145500+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": 698
} | 2026-06-01T05:00:40.145500+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": 2466
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1705-D | codeforces | 1705-D | Mark and Lightbulbs | https://codeforces.com/problemset/problem/1705/D | [
"combinatorics",
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7184
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1705-C | codeforces | 1705-C | Mark and His Unfinished Essay | https://codeforces.com/problemset/problem/1705/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14623
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1705-B | codeforces | 1705-B | Mark the Dust Sweeper | https://codeforces.com/problemset/problem/1705/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1705-A | codeforces | 1705-A | Mark the Photographer | https://codeforces.com/problemset/problem/1705/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26619
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1704-H2 | codeforces | 1704-H2 | Game of AI (hard version) | https://codeforces.com/problemset/problem/1704/H2 | [
"combinatorics",
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 112
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1704-H1 | codeforces | 1704-H1 | Game of AI (easy version) | https://codeforces.com/problemset/problem/1704/H1 | [
"combinatorics",
"constructive algorithms",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 239
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1704-G | codeforces | 1704-G | Mio and Lucky Array | https://codeforces.com/problemset/problem/1704/G | [
"constructive algorithms",
"fft",
"math",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 134
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1704-F | codeforces | 1704-F | Colouring Game | https://codeforces.com/problemset/problem/1704/F | [
"constructive algorithms",
"dp",
"games"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1310
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1704-E | codeforces | 1704-E | Count Seconds | https://codeforces.com/problemset/problem/1704/E | [
"brute force",
"constructive algorithms",
"dp",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2695
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1704-D | codeforces | 1704-D | Magical Array | https://codeforces.com/problemset/problem/1704/D | [
"constructive algorithms",
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5388
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1704-C | codeforces | 1704-C | Virus | https://codeforces.com/problemset/problem/1704/C | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25278
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1704-B | codeforces | 1704-B | Luke is a Foodie | https://codeforces.com/problemset/problem/1704/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 30535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1704-A | codeforces | 1704-A | Two 0-1 Sequences | https://codeforces.com/problemset/problem/1704/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16671
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1703-G | codeforces | 1703-G | Good Key, Bad Key | https://codeforces.com/problemset/problem/1703/G | [
"bitmasks",
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12816
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1703-F | codeforces | 1703-F | Yet Another Problem About Pairs Satisfying an Inequality | https://codeforces.com/problemset/problem/1703/F | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 30510
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1703-E | codeforces | 1703-E | Mirror Grid | https://codeforces.com/problemset/problem/1703/E | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 28029
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1703-D | codeforces | 1703-D | Double Strings | https://codeforces.com/problemset/problem/1703/D | [
"brute force",
"data structures",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 29287
} | 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.