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:1692-D | codeforces | 1692-D | The Clock | https://codeforces.com/problemset/problem/1692/D | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22148
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1692-C | codeforces | 1692-C | Where's the Bishop? | https://codeforces.com/problemset/problem/1692/C | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39553
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1692-B | codeforces | 1692-B | All Distinct | https://codeforces.com/problemset/problem/1692/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40215
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1692-A | codeforces | 1692-A | Marathon | https://codeforces.com/problemset/problem/1692/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 88488
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1691-F | codeforces | 1691-F | K-Set Tree | https://codeforces.com/problemset/problem/1691/F | [
"combinatorics",
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1186
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1691-E | codeforces | 1691-E | Number of Groups | https://codeforces.com/problemset/problem/1691/E | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2169
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1691-D | codeforces | 1691-D | Max GEQ Sum | https://codeforces.com/problemset/problem/1691/D | [
"binary search",
"constructive algorithms",
"data structures",
"divide and conquer",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7788
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1691-C | codeforces | 1691-C | Sum of Substrings | https://codeforces.com/problemset/problem/1691/C | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17399
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1691-B | codeforces | 1691-B | Shoe Shuffling | https://codeforces.com/problemset/problem/1691/B | [
"constructive algorithms",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 37877
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1691-A | codeforces | 1691-A | Beat The Odds | https://codeforces.com/problemset/problem/1691/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32417
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1690-G | codeforces | 1690-G | Count the Trains | https://codeforces.com/problemset/problem/1690/G | [
"binary search",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4226
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1690-F | codeforces | 1690-F | Shifting String | https://codeforces.com/problemset/problem/1690/F | [
"graphs",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9219
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1690-E | codeforces | 1690-E | Price Maximization | https://codeforces.com/problemset/problem/1690/E | [
"binary search",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17216
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1690-D | codeforces | 1690-D | Black and White Stripe | https://codeforces.com/problemset/problem/1690/D | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 50550
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1690-C | codeforces | 1690-C | Restoring the Duration of Tasks | https://codeforces.com/problemset/problem/1690/C | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28296
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1690-B | codeforces | 1690-B | Array Decrements | https://codeforces.com/problemset/problem/1690/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27104
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1690-A | codeforces | 1690-A | Print a Pedestal (Codeforces logo?) | https://codeforces.com/problemset/problem/1690/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35863
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1689-E | codeforces | 1689-E | ANDfinity | https://codeforces.com/problemset/problem/1689/E | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1413
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1689-D | codeforces | 1689-D | Lena and Matrix | https://codeforces.com/problemset/problem/1689/D | [
"data structures",
"dp",
"geometry",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4808
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1689-C | codeforces | 1689-C | Infected Tree | https://codeforces.com/problemset/problem/1689/C | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13949
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1689-B | codeforces | 1689-B | Mystic Permutation | https://codeforces.com/problemset/problem/1689/B | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19355
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1689-A | codeforces | 1689-A | Lex String | https://codeforces.com/problemset/problem/1689/A | [
"brute force",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17821
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1688-C | codeforces | 1688-C | Manipulating History | https://codeforces.com/problemset/problem/1688/C | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8845
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1688-B | codeforces | 1688-B | Patchouli's Magical Talisman | https://codeforces.com/problemset/problem/1688/B | [
"bitmasks",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19179
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1688-A | codeforces | 1688-A | Cirno's Perfect Bitmasks Classroom | https://codeforces.com/problemset/problem/1688/A | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23777
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1687-F | codeforces | 1687-F | Koishi's Unconscious Permutation | https://codeforces.com/problemset/problem/1687/F | [
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 113
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1687-E | codeforces | 1687-E | Become Big For Me | https://codeforces.com/problemset/problem/1687/E | [
"combinatorics",
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 325
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1687-D | codeforces | 1687-D | Cute number | https://codeforces.com/problemset/problem/1687/D | [
"binary search",
"brute force",
"data structures",
"dsu",
"implementation",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 792
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1687-C | codeforces | 1687-C | Sanae and Giant Robot | https://codeforces.com/problemset/problem/1687/C | [
"binary search",
"brute force",
"data structures",
"dsu",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1740
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1687-B | codeforces | 1687-B | Railway System | https://codeforces.com/problemset/problem/1687/B | [
"constructive algorithms",
"graphs",
"greedy",
"interactive",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4202
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1687-A | codeforces | 1687-A | The Enchanted Forest | https://codeforces.com/problemset/problem/1687/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11530
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1686-B | codeforces | 1686-B | Odd Subarrays | https://codeforces.com/problemset/problem/1686/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19471
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1686-A | codeforces | 1686-A | Everything Everywhere All But One | https://codeforces.com/problemset/problem/1686/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21304
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1685-E | codeforces | 1685-E | The Ultimate LIS Problem | https://codeforces.com/problemset/problem/1685/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 201
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1685-D2 | codeforces | 1685-D2 | Permutation Weight (Hard Version) | https://codeforces.com/problemset/problem/1685/D2 | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 144
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1685-D1 | codeforces | 1685-D1 | Permutation Weight (Easy Version) | https://codeforces.com/problemset/problem/1685/D1 | [
"constructive algorithms",
"dfs and similar",
"dsu"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 545
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1685-C | codeforces | 1685-C | Bring Balance | https://codeforces.com/problemset/problem/1685/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1435
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1685-B | codeforces | 1685-B | Linguistics | https://codeforces.com/problemset/problem/1685/B | [
"greedy",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3739
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1685-A | codeforces | 1685-A | Circular Local MiniMax | https://codeforces.com/problemset/problem/1685/A | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18709
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1684-H | codeforces | 1684-H | Hard Cut | https://codeforces.com/problemset/problem/1684/H | [
"constructive algorithms",
"dfs and similar",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 312
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1684-G | codeforces | 1684-G | Euclid Guess | https://codeforces.com/problemset/problem/1684/G | [
"constructive algorithms",
"flows",
"graph matchings",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 865
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1684-F | codeforces | 1684-F | Diverse Segments | https://codeforces.com/problemset/problem/1684/F | [
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1237
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1684-E | codeforces | 1684-E | MEX vs DIFF | https://codeforces.com/problemset/problem/1684/E | [
"binary search",
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3706
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1684-D | codeforces | 1684-D | Traps | https://codeforces.com/problemset/problem/1684/D | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10888
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1684-C | codeforces | 1684-C | Column Swapping | https://codeforces.com/problemset/problem/1684/C | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13349
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1684-B | codeforces | 1684-B | Z mod X = C | https://codeforces.com/problemset/problem/1684/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21935
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1684-A | codeforces | 1684-A | Digit Minimization | https://codeforces.com/problemset/problem/1684/A | [
"constructive algorithms",
"games",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25049
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1682-F | codeforces | 1682-F | MCMF? | https://codeforces.com/problemset/problem/1682/F | [
"data structures",
"flows",
"graphs",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 473
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1682-E | codeforces | 1682-E | Unordered Swaps | https://codeforces.com/problemset/problem/1682/E | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 779
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1682-D | codeforces | 1682-D | Circular Spanning Tree | https://codeforces.com/problemset/problem/1682/D | [
"constructive algorithms",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3780
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1682-C | codeforces | 1682-C | LIS or Reverse LIS? | https://codeforces.com/problemset/problem/1682/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16625
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1682-B | codeforces | 1682-B | AND Sorting | https://codeforces.com/problemset/problem/1682/B | [
"bitmasks",
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28105
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1682-A | codeforces | 1682-A | Palindromic Indices | https://codeforces.com/problemset/problem/1682/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20027
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1681-F | codeforces | 1681-F | Unique Occurrences | https://codeforces.com/problemset/problem/1681/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"dp",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2454
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1681-E | codeforces | 1681-E | Labyrinth Adventures | https://codeforces.com/problemset/problem/1681/E | [
"data structures",
"dp",
"matrices",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1000
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1681-D | codeforces | 1681-D | Required Length | https://codeforces.com/problemset/problem/1681/D | [
"brute force",
"dfs and similar",
"dp",
"hashing",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10899
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1681-C | codeforces | 1681-C | Double Sort | https://codeforces.com/problemset/problem/1681/C | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18908
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1681-B | codeforces | 1681-B | Card Trick | https://codeforces.com/problemset/problem/1681/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21133
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1681-A | codeforces | 1681-A | Game with Cards | https://codeforces.com/problemset/problem/1681/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21762
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1680-F | codeforces | 1680-F | Lenient Vertex Cover | https://codeforces.com/problemset/problem/1680/F | [
"dfs and similar",
"divide and conquer",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 980
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1680-E | codeforces | 1680-E | Moving Chips | https://codeforces.com/problemset/problem/1680/E | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4426
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1680-D | codeforces | 1680-D | Dog Walking | https://codeforces.com/problemset/problem/1680/D | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1391
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1680-C | codeforces | 1680-C | Binary String | https://codeforces.com/problemset/problem/1680/C | [
"binary search",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11281
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1680-B | codeforces | 1680-B | Robots | https://codeforces.com/problemset/problem/1680/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19139
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1680-A | codeforces | 1680-A | Minimums and Maximums | https://codeforces.com/problemset/problem/1680/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22435
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1679-F | codeforces | 1679-F | Formalism for Formalism | https://codeforces.com/problemset/problem/1679/F | [
"bitmasks",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 820
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1679-E | codeforces | 1679-E | Typical Party in Dorm | https://codeforces.com/problemset/problem/1679/E | [
"bitmasks",
"combinatorics",
"dp",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1457
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1679-D | codeforces | 1679-D | Toss a Coin to Your Graph... | https://codeforces.com/problemset/problem/1679/D | [
"binary search",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6057
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1679-C | codeforces | 1679-C | Rooks Defenders | https://codeforces.com/problemset/problem/1679/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11856
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1679-B | codeforces | 1679-B | Stone Age Problem | https://codeforces.com/problemset/problem/1679/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 29236
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1679-A | codeforces | 1679-A | AvtoBus | https://codeforces.com/problemset/problem/1679/A | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 43397
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1678-B2 | codeforces | 1678-B2 | Tokitsukaze and Good 01-String (hard version) | https://codeforces.com/problemset/problem/1678/B2 | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7391
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1678-B1 | codeforces | 1678-B1 | Tokitsukaze and Good 01-String (easy version) | https://codeforces.com/problemset/problem/1678/B1 | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16678
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1678-A | codeforces | 1678-A | Tokitsukaze and All Zero Sequence | https://codeforces.com/problemset/problem/1678/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19225
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1677-F | codeforces | 1677-F | Tokitsukaze and Gems | https://codeforces.com/problemset/problem/1677/F | [
"dp",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 180
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1677-E | codeforces | 1677-E | Tokitsukaze and Beautiful Subsegments | https://codeforces.com/problemset/problem/1677/E | [
"data structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 747
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1677-D | codeforces | 1677-D | Tokitsukaze and Permutations | https://codeforces.com/problemset/problem/1677/D | [
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1511
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1677-C | codeforces | 1677-C | Tokitsukaze and Two Colorful Tapes | https://codeforces.com/problemset/problem/1677/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4145
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1677-B | codeforces | 1677-B | Tokitsukaze and Meeting | https://codeforces.com/problemset/problem/1677/B | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4588
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1677-A | codeforces | 1677-A | Tokitsukaze and Strange Inequality | https://codeforces.com/problemset/problem/1677/A | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9446
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1676-H2 | codeforces | 1676-H2 | Maximum Crossings (Hard Version) | https://codeforces.com/problemset/problem/1676/H2 | [
"data structures",
"divide and conquer",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13510
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1676-H1 | codeforces | 1676-H1 | Maximum Crossings (Easy Version) | https://codeforces.com/problemset/problem/1676/H1 | [
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16598
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1676-G | codeforces | 1676-G | White-Black Balanced Subtrees | https://codeforces.com/problemset/problem/1676/G | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 26012
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1676-F | codeforces | 1676-F | Longest Strike | https://codeforces.com/problemset/problem/1676/F | [
"data structures",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20659
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1676-E | codeforces | 1676-E | Eating Queries | https://codeforces.com/problemset/problem/1676/E | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 34277
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1676-D | codeforces | 1676-D | X-Sum | https://codeforces.com/problemset/problem/1676/D | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29937
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1676-C | codeforces | 1676-C | Most Similar Words | https://codeforces.com/problemset/problem/1676/C | [
"brute force",
"greedy",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35457
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1676-B | codeforces | 1676-B | Equal Candies | https://codeforces.com/problemset/problem/1676/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 62282
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1676-A | codeforces | 1676-A | Lucky? | https://codeforces.com/problemset/problem/1676/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 90661
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1675-G | codeforces | 1675-G | Sorting Pancakes | https://codeforces.com/problemset/problem/1675/G | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2169
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1675-F | codeforces | 1675-F | Vlad and Unfinished Business | https://codeforces.com/problemset/problem/1675/F | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6397
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1675-E | codeforces | 1675-E | Replace With the Previous, Minimize | https://codeforces.com/problemset/problem/1675/E | [
"dsu",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12248
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1675-D | codeforces | 1675-D | Vertical Paths | https://codeforces.com/problemset/problem/1675/D | [
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15078
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1675-C | codeforces | 1675-C | Detective Task | https://codeforces.com/problemset/problem/1675/C | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19487
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1675-B | codeforces | 1675-B | Make It Increasing | https://codeforces.com/problemset/problem/1675/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 46559
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1675-A | codeforces | 1675-A | Food for Animals | https://codeforces.com/problemset/problem/1675/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 37184
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1674-G | codeforces | 1674-G | Remove Directed Edges | https://codeforces.com/problemset/problem/1674/G | [
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2965
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1674-F | codeforces | 1674-F | Desktop Rearrangement | https://codeforces.com/problemset/problem/1674/F | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5736
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1674-E | codeforces | 1674-E | Breaking the Wall | https://codeforces.com/problemset/problem/1674/E | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7834
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1674-D | codeforces | 1674-D | A-B-C Sort | https://codeforces.com/problemset/problem/1674/D | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17919
} | 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.