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:1697-F | codeforces | 1697-F | Too Many Constraints | https://codeforces.com/problemset/problem/1697/F | [
"2-sat",
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 892
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1697-E | codeforces | 1697-E | Coloring | https://codeforces.com/problemset/problem/1697/E | [
"brute force",
"combinatorics",
"constructive algorithms",
"dp",
"geometry",
"graphs",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1509
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1697-D | codeforces | 1697-D | Guess The String | https://codeforces.com/problemset/problem/1697/D | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5140
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1697-C | codeforces | 1697-C | awoo's Favorite Problem | https://codeforces.com/problemset/problem/1697/C | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16087
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1697-B | codeforces | 1697-B | Promo | https://codeforces.com/problemset/problem/1697/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 31910
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1697-A | codeforces | 1697-A | Parkway Walk | https://codeforces.com/problemset/problem/1697/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26973
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1696-H | codeforces | 1696-H | Maximum Product? | https://codeforces.com/problemset/problem/1696/H | [
"brute force",
"combinatorics",
"dp",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 221
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1696-G | codeforces | 1696-G | Fishingprince Plays With Array Again | https://codeforces.com/problemset/problem/1696/G | [
"brute force",
"data structures",
"geometry",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 458
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1696-F | codeforces | 1696-F | Tree Recovery | https://codeforces.com/problemset/problem/1696/F | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1188
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1696-E | codeforces | 1696-E | Placing Jinas | https://codeforces.com/problemset/problem/1696/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5104
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1696-D | codeforces | 1696-D | Permutation Graph | https://codeforces.com/problemset/problem/1696/D | [
"binary search",
"constructive algorithms",
"data structures",
"divide and conquer",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6121
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1696-C | codeforces | 1696-C | Fishingprince Plays With Array | https://codeforces.com/problemset/problem/1696/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12750
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1696-B | codeforces | 1696-B | NIT Destroys the Universe | https://codeforces.com/problemset/problem/1696/B | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 41674
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1696-A | codeforces | 1696-A | NIT orz! | https://codeforces.com/problemset/problem/1696/A | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20576
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1695-E | codeforces | 1695-E | Ambiguous Dominoes | https://codeforces.com/problemset/problem/1695/E | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 567
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1695-D2 | codeforces | 1695-D2 | Tree Queries (Hard Version) | https://codeforces.com/problemset/problem/1695/D2 | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2367
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1695-D1 | codeforces | 1695-D1 | Tree Queries (Easy Version) | https://codeforces.com/problemset/problem/1695/D1 | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2538
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1695-C | codeforces | 1695-C | Zero Path | https://codeforces.com/problemset/problem/1695/C | [
"brute force",
"data structures",
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14971
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1695-B | codeforces | 1695-B | Circle Game | https://codeforces.com/problemset/problem/1695/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20330
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1695-A | codeforces | 1695-A | Subrectangle Guess | https://codeforces.com/problemset/problem/1695/A | [
"games"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16876
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1694-B | codeforces | 1694-B | Paranoid String | https://codeforces.com/problemset/problem/1694/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20925
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1694-A | codeforces | 1694-A | Creep | https://codeforces.com/problemset/problem/1694/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23666
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1693-F | codeforces | 1693-F | I Might Be Wrong | https://codeforces.com/problemset/problem/1693/F | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 685
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1693-E | codeforces | 1693-E | Outermost Maximums | https://codeforces.com/problemset/problem/1693/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 577
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1693-D | codeforces | 1693-D | Decinc Dividing | https://codeforces.com/problemset/problem/1693/D | [
"brute force",
"data structures",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1215
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1693-C | codeforces | 1693-C | Keshi in Search of AmShZ | https://codeforces.com/problemset/problem/1693/C | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3342
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1693-B | codeforces | 1693-B | Fake Plastic Trees | https://codeforces.com/problemset/problem/1693/B | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9852
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1693-A | codeforces | 1693-A | Directional Increase | https://codeforces.com/problemset/problem/1693/A | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17655
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1692-H | codeforces | 1692-H | Gambling | https://codeforces.com/problemset/problem/1692/H | [
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10301
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1692-G | codeforces | 1692-G | 2^Sort | https://codeforces.com/problemset/problem/1692/G | [
"data structures",
"dp",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 29106
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1692-F | codeforces | 1692-F | 3SUM | https://codeforces.com/problemset/problem/1692/F | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 28426
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1692-E | codeforces | 1692-E | Binary Deque | https://codeforces.com/problemset/problem/1692/E | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 37621
} | 2026-11-02T05:37:07.883505+00:00 |
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": 22364
} | 2026-11-02T05:37:07.883505+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": 40001
} | 2026-11-02T05:37:07.883505+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": 40779
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1692-A | codeforces | 1692-A | Marathon | https://codeforces.com/problemset/problem/1692/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 91124
} | 2026-11-02T05:37:07.883505+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": 1215
} | 2026-11-02T05:37:07.883505+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": 2234
} | 2026-11-02T05:37:07.883505+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": 8058
} | 2026-11-02T05:37:07.883505+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": 17589
} | 2026-11-02T05:37:07.883505+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": 39731
} | 2026-11-02T05:37:07.883505+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": 32725
} | 2026-11-02T05:37:07.883505+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": 4283
} | 2026-11-02T05:37:07.883505+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": 9441
} | 2026-11-02T05:37:07.883505+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": 17456
} | 2026-11-02T05:37:07.883505+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": 53529
} | 2026-11-02T05:37:07.883505+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": 28438
} | 2026-11-02T05:37:07.883505+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": 27210
} | 2026-11-02T05:37:07.883505+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": 36046
} | 2026-11-02T05:37:07.883505+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": 1443
} | 2026-11-02T05:37:07.883505+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": 4867
} | 2026-11-02T05:37:07.883505+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": 14375
} | 2026-11-02T05:37:07.883505+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": 19474
} | 2026-11-02T05:37:07.883505+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": 17940
} | 2026-11-02T05:37:07.883505+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": 8895
} | 2026-11-02T05:37:07.883505+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": 19257
} | 2026-11-02T05:37:07.883505+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": 24114
} | 2026-11-02T05:37:07.883505+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": 115
} | 2026-11-02T05:37:07.883505+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": 333
} | 2026-11-02T05:37:07.883505+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": 797
} | 2026-11-02T05:37:07.883505+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": 1761
} | 2026-11-02T05:37:07.883505+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": 4226
} | 2026-11-02T05:37:07.883505+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": 11628
} | 2026-11-02T05:37:07.883505+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": 19530
} | 2026-11-02T05:37:07.883505+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": 21363
} | 2026-11-02T05:37:07.883505+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": 208
} | 2026-11-02T05:37:07.883505+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": 149
} | 2026-11-02T05:37:07.883505+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": 553
} | 2026-11-02T05:37:07.883505+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": 1502
} | 2026-11-02T05:37:07.883505+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": 3770
} | 2026-11-02T05:37:07.883505+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": 18814
} | 2026-11-02T05:37:07.883505+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": 316
} | 2026-11-02T05:37:07.883505+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": 893
} | 2026-11-02T05:37:07.883505+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": 1260
} | 2026-11-02T05:37:07.883505+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": 3737
} | 2026-11-02T05:37:07.883505+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": 10968
} | 2026-11-02T05:37:07.883505+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": 13409
} | 2026-11-02T05:37:07.883505+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": 22016
} | 2026-11-02T05:37:07.883505+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": 25136
} | 2026-11-02T05:37:07.883505+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": 482
} | 2026-11-02T05:37:07.883505+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": 805
} | 2026-11-02T05:37:07.883505+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": 3826
} | 2026-11-02T05:37:07.883505+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": 17030
} | 2026-11-02T05:37:07.883505+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": 29229
} | 2026-11-02T05:37:07.883505+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": 20116
} | 2026-11-02T05:37:07.883505+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": 2569
} | 2026-11-02T05:37:07.883505+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": 1095
} | 2026-11-02T05:37:07.883505+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": 11009
} | 2026-11-02T05:37:07.883505+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": 19042
} | 2026-11-02T05:37:07.883505+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": 21256
} | 2026-11-02T05:37:07.883505+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": 21814
} | 2026-11-02T05:37:07.883505+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": 1019
} | 2026-11-02T05:37:07.883505+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": 4484
} | 2026-11-02T05:37:07.883505+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": 1437
} | 2026-11-02T05:37:07.883505+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": 11439
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1680-B | codeforces | 1680-B | Robots | https://codeforces.com/problemset/problem/1680/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19201
} | 2026-11-02T05:37:07.883505+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": 22510
} | 2026-11-02T05:37:07.883505+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": 876
} | 2026-11-02T05:37:07.883505+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": 1477
} | 2026-11-02T05:37:07.883505+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": 6224
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.