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:1631-A | codeforces | 1631-A | Min Max Swap | https://codeforces.com/problemset/problem/1631/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31347
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1630-F | codeforces | 1630-F | Making It Bipartite | https://codeforces.com/problemset/problem/1630/F | [
"flows",
"graph matchings",
"graphs",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 920
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1630-E | codeforces | 1630-E | Expected Components | https://codeforces.com/problemset/problem/1630/E | [
"combinatorics",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 578
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1630-D | codeforces | 1630-D | Flipping Range | https://codeforces.com/problemset/problem/1630/D | [
"constructive algorithms",
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2005
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1630-C | codeforces | 1630-C | Paint the Middle | https://codeforces.com/problemset/problem/1630/C | [
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3336
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1630-B | codeforces | 1630-B | Range and Partition | https://codeforces.com/problemset/problem/1630/B | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6500
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1630-A | codeforces | 1630-A | And Matching | https://codeforces.com/problemset/problem/1630/A | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16209
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1629-B | codeforces | 1629-B | GCD Arrays | https://codeforces.com/problemset/problem/1629/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25328
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1629-A | codeforces | 1629-A | Download More RAM | https://codeforces.com/problemset/problem/1629/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30972
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1628-F | codeforces | 1628-F | Spaceship Crisis Management | https://codeforces.com/problemset/problem/1628/F | [
"binary search",
"data structures",
"geometry",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 98
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1628-E | codeforces | 1628-E | Groceries in Meteor Town | https://codeforces.com/problemset/problem/1628/E | [
"binary search",
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1235
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1628-D2 | codeforces | 1628-D2 | Game on Sum (Hard Version) | https://codeforces.com/problemset/problem/1628/D2 | [
"combinatorics",
"dp",
"games",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2645
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1628-D1 | codeforces | 1628-D1 | Game on Sum (Easy Version) | https://codeforces.com/problemset/problem/1628/D1 | [
"combinatorics",
"dp",
"games",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3714
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1628-C | codeforces | 1628-C | Grid Xor | https://codeforces.com/problemset/problem/1628/C | [
"constructive algorithms",
"greedy",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3582
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1628-B | codeforces | 1628-B | Peculiar Movie Preferences | https://codeforces.com/problemset/problem/1628/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12744
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1628-A | codeforces | 1628-A | Meximum Array | https://codeforces.com/problemset/problem/1628/A | [
"binary search",
"constructive algorithms",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17057
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1627-F | codeforces | 1627-F | Not Splitting | https://codeforces.com/problemset/problem/1627/F | [
"geometry",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 656
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1627-E | codeforces | 1627-E | Not Escaping | https://codeforces.com/problemset/problem/1627/E | [
"data structures",
"dp",
"implementation",
"shortest paths",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2804
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1627-D | codeforces | 1627-D | Not Adding | https://codeforces.com/problemset/problem/1627/D | [
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9416
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1627-C | codeforces | 1627-C | Not Assigning | https://codeforces.com/problemset/problem/1627/C | [
"constructive algorithms",
"dfs and similar",
"number theory",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16310
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1627-B | codeforces | 1627-B | Not Sitting | https://codeforces.com/problemset/problem/1627/B | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17586
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1627-A | codeforces | 1627-A | Not Shading | https://codeforces.com/problemset/problem/1627/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24917
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1626-F | codeforces | 1626-F | A Random Code Problem | https://codeforces.com/problemset/problem/1626/F | [
"combinatorics",
"dp",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 907
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1626-E | codeforces | 1626-E | Black and White Tree | https://codeforces.com/problemset/problem/1626/E | [
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1862
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1626-D | codeforces | 1626-D | Martial Arts Tournament | https://codeforces.com/problemset/problem/1626/D | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4340
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1626-C | codeforces | 1626-C | Monsters And Spells | https://codeforces.com/problemset/problem/1626/C | [
"binary search",
"data structures",
"dp",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11862
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1626-B | codeforces | 1626-B | Minor Reduction | https://codeforces.com/problemset/problem/1626/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23977
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1626-A | codeforces | 1626-A | Equidistant Letters | https://codeforces.com/problemset/problem/1626/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30945
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1625-E2 | codeforces | 1625-E2 | Cats on the Upgrade (hard version) | https://codeforces.com/problemset/problem/1625/E2 | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 664
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1625-E1 | codeforces | 1625-E1 | Cats on the Upgrade (easy version) | https://codeforces.com/problemset/problem/1625/E1 | [
"brute force",
"data structures",
"dfs and similar",
"divide and conquer",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1155
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1625-D | codeforces | 1625-D | Binary Spiders | https://codeforces.com/problemset/problem/1625/D | [
"bitmasks",
"data structures",
"implementation",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2328
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1625-C | codeforces | 1625-C | Road Optimization | https://codeforces.com/problemset/problem/1625/C | [
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13417
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1625-B | codeforces | 1625-B | Elementary Particles | https://codeforces.com/problemset/problem/1625/B | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16884
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1625-A | codeforces | 1625-A | Ancient Civilization | https://codeforces.com/problemset/problem/1625/A | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18316
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1624-G | codeforces | 1624-G | MinOr Tree | https://codeforces.com/problemset/problem/1624/G | [
"bitmasks",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7659
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1624-F | codeforces | 1624-F | Interacdive Problem | https://codeforces.com/problemset/problem/1624/F | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3819
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1624-E | codeforces | 1624-E | Masha-forgetful | https://codeforces.com/problemset/problem/1624/E | [
"brute force",
"constructive algorithms",
"dp",
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4613
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1624-D | codeforces | 1624-D | Palindromes Coloring | https://codeforces.com/problemset/problem/1624/D | [
"binary search",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19159
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1624-C | codeforces | 1624-C | Division by Two and Permutation | https://codeforces.com/problemset/problem/1624/C | [
"constructive algorithms",
"flows",
"graph matchings",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26937
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1624-B | codeforces | 1624-B | Make AP | https://codeforces.com/problemset/problem/1624/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 53759
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1624-A | codeforces | 1624-A | Plus One on the Subset | https://codeforces.com/problemset/problem/1624/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 60529
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1623-E | codeforces | 1623-E | Middle Duplication | https://codeforces.com/problemset/problem/1623/E | [
"data structures",
"dfs and similar",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1268
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1623-D | codeforces | 1623-D | Robot Cleaner Revisit | https://codeforces.com/problemset/problem/1623/D | [
"implementation",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1474
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1623-C | codeforces | 1623-C | Balanced Stone Heaps | https://codeforces.com/problemset/problem/1623/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14387
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1623-B | codeforces | 1623-B | Game on Ranges | https://codeforces.com/problemset/problem/1623/B | [
"brute force",
"dfs and similar",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14684
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1623-A | codeforces | 1623-A | Robot Cleaner | https://codeforces.com/problemset/problem/1623/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1622-F | codeforces | 1622-F | Quadratic Set | https://codeforces.com/problemset/problem/1622/F | [
"constructive algorithms",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 868
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1622-E | codeforces | 1622-E | Math Test | https://codeforces.com/problemset/problem/1622/E | [
"bitmasks",
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1622-D | codeforces | 1622-D | Shuffle | https://codeforces.com/problemset/problem/1622/D | [
"combinatorics",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4659
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1622-C | codeforces | 1622-C | Set or Decrease | https://codeforces.com/problemset/problem/1622/C | [
"binary search",
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15615
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1622-B | codeforces | 1622-B | Berland Music | https://codeforces.com/problemset/problem/1622/B | [
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22348
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1622-A | codeforces | 1622-A | Construct a Rectangle | https://codeforces.com/problemset/problem/1622/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32074
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1621-I | codeforces | 1621-I | Two Sequences | https://codeforces.com/problemset/problem/1621/I | [
"data structures",
"hashing",
"string suffix structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 145
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1621-H | codeforces | 1621-H | Trains and Airplanes | https://codeforces.com/problemset/problem/1621/H | [
"dfs and similar",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 199
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1621-G | codeforces | 1621-G | Weighted Increasing Subsequences | https://codeforces.com/problemset/problem/1621/G | [
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 780
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1621-F | codeforces | 1621-F | Strange Instructions | https://codeforces.com/problemset/problem/1621/F | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 637
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1621-E | codeforces | 1621-E | New School | https://codeforces.com/problemset/problem/1621/E | [
"binary search",
"data structures",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1926
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1621-D | codeforces | 1621-D | The Winter Hike | https://codeforces.com/problemset/problem/1621/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4402
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1621-C | codeforces | 1621-C | Hidden Permutations | https://codeforces.com/problemset/problem/1621/C | [
"dfs and similar",
"interactive",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7522
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1621-B | codeforces | 1621-B | Integers Shop | https://codeforces.com/problemset/problem/1621/B | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14586
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1621-A | codeforces | 1621-A | Stable Arrangement of Rooks | https://codeforces.com/problemset/problem/1621/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24797
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1620-G | codeforces | 1620-G | Subsequences Galore | https://codeforces.com/problemset/problem/1620/G | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1164
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1620-F | codeforces | 1620-F | Bipartite Array | https://codeforces.com/problemset/problem/1620/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 753
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1620-E | codeforces | 1620-E | Replace the Numbers | https://codeforces.com/problemset/problem/1620/E | [
"constructive algorithms",
"data structures",
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9711
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1620-D | codeforces | 1620-D | Exact Change | https://codeforces.com/problemset/problem/1620/D | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4824
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1620-C | codeforces | 1620-C | BA-String | https://codeforces.com/problemset/problem/1620/C | [
"brute force",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7286
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1620-B | codeforces | 1620-B | Triangles on a Rectangle | https://codeforces.com/problemset/problem/1620/B | [
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32020
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1620-A | codeforces | 1620-A | Equal or Not Equal | https://codeforces.com/problemset/problem/1620/A | [
"constructive algorithms",
"dsu",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23209
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1619-H | codeforces | 1619-H | Permutation and Queries | https://codeforces.com/problemset/problem/1619/H | [
"brute force",
"data structures",
"divide and conquer",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1449
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1619-G | codeforces | 1619-G | Unusual Minesweeper | https://codeforces.com/problemset/problem/1619/G | [
"binary search",
"dfs and similar",
"dsu",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2744
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1619-F | codeforces | 1619-F | Let's Play the Hat? | https://codeforces.com/problemset/problem/1619/F | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2346
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1619-E | codeforces | 1619-E | MEX and Increments | https://codeforces.com/problemset/problem/1619/E | [
"constructive algorithms",
"data structures",
"dp",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10243
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1619-D | codeforces | 1619-D | New Year's Problem | https://codeforces.com/problemset/problem/1619/D | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8487
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1619-C | codeforces | 1619-C | Wrong Addition | https://codeforces.com/problemset/problem/1619/C | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22727
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1619-B | codeforces | 1619-B | Squares and Cubes | https://codeforces.com/problemset/problem/1619/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33001
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1619-A | codeforces | 1619-A | Square String? | https://codeforces.com/problemset/problem/1619/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 63141
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1618-G | codeforces | 1618-G | Trader Problem | https://codeforces.com/problemset/problem/1618/G | [
"data structures",
"dsu",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1944
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1618-F | codeforces | 1618-F | Reverse | https://codeforces.com/problemset/problem/1618/F | [
"bitmasks",
"constructive algorithms",
"dfs and similar",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4743
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1618-E | codeforces | 1618-E | Singers' Tour | https://codeforces.com/problemset/problem/1618/E | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7799
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1618-D | codeforces | 1618-D | Array and Operations | https://codeforces.com/problemset/problem/1618/D | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20954
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1618-C | codeforces | 1618-C | Paint the Array | https://codeforces.com/problemset/problem/1618/C | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 32861
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1618-B | codeforces | 1618-B | Missing Bigram | https://codeforces.com/problemset/problem/1618/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23868
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1618-A | codeforces | 1618-A | Polycarp and Sums of Subsequences | https://codeforces.com/problemset/problem/1618/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34554
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1617-E | codeforces | 1617-E | Christmas Chocolates | https://codeforces.com/problemset/problem/1617/E | [
"dfs and similar",
"dp",
"games",
"graphs",
"implementation",
"math",
"number theory",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1034
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1617-D2 | codeforces | 1617-D2 | Too Many Impostors (hard version) | https://codeforces.com/problemset/problem/1617/D2 | [
"constructive algorithms",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2044
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1617-D1 | codeforces | 1617-D1 | Too Many Impostors (easy version) | https://codeforces.com/problemset/problem/1617/D1 | [
"constructive algorithms",
"implementation",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5190
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1617-C | codeforces | 1617-C | Paprika and Permutation | https://codeforces.com/problemset/problem/1617/C | [
"binary search",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16024
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1617-B | codeforces | 1617-B | GCD Problem | https://codeforces.com/problemset/problem/1617/B | [
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26937
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1617-A | codeforces | 1617-A | Forbidden Subsequence | https://codeforces.com/problemset/problem/1617/A | [
"constructive algorithms",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17016
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1616-H | codeforces | 1616-H | Keep XOR Low | https://codeforces.com/problemset/problem/1616/H | [
"bitmasks",
"combinatorics",
"data structures",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1244
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1616-G | codeforces | 1616-G | Just Add an Edge | https://codeforces.com/problemset/problem/1616/G | [
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 425
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1616-F | codeforces | 1616-F | Tricolor Triangles | https://codeforces.com/problemset/problem/1616/F | [
"brute force",
"graphs",
"math",
"matrices"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 722
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1616-E | codeforces | 1616-E | Lexicographically Small Enough | https://codeforces.com/problemset/problem/1616/E | [
"brute force",
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2722
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1616-D | codeforces | 1616-D | Keep the Average High | https://codeforces.com/problemset/problem/1616/D | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1616-C | codeforces | 1616-C | Representative Edges | https://codeforces.com/problemset/problem/1616/C | [
"brute force",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13231
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1616-B | codeforces | 1616-B | Mirror in the String | https://codeforces.com/problemset/problem/1616/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20734
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1616-A | codeforces | 1616-A | Integer Diversity | https://codeforces.com/problemset/problem/1616/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23956
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1615-H | codeforces | 1615-H | Reindeer Games | https://codeforces.com/problemset/problem/1615/H | [
"binary search",
"constructive algorithms",
"data structures",
"divide and conquer",
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 388
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1615-G | codeforces | 1615-G | Maximum Adjacent Pairs | https://codeforces.com/problemset/problem/1615/G | [
"constructive algorithms",
"graph matchings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 172
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1615-F | codeforces | 1615-F | LEGOndary Grandmaster | https://codeforces.com/problemset/problem/1615/F | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1150
} | 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.