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: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": 3963
} | 2026-11-02T05:37:07.883505+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": 4727
} | 2026-11-02T05:37:07.883505+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": 19647
} | 2026-11-02T05:37:07.883505+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": 27390
} | 2026-11-02T05:37:07.883505+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": 58508
} | 2026-11-02T05:37:07.883505+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": 61909
} | 2026-11-02T05:37:07.883505+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": 1382
} | 2026-11-02T05:37:07.883505+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": 1520
} | 2026-11-02T05:37:07.883505+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": 14885
} | 2026-11-02T05:37:07.883505+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": 14814
} | 2026-11-02T05:37:07.883505+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": 20901
} | 2026-11-02T05:37:07.883505+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": 1003
} | 2026-11-02T05:37:07.883505+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": 2339
} | 2026-11-02T05:37:07.883505+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": 5066
} | 2026-11-02T05:37:07.883505+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": 16186
} | 2026-11-02T05:37:07.883505+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": 22606
} | 2026-11-02T05:37:07.883505+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": 32533
} | 2026-11-02T05:37:07.883505+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": 154
} | 2026-11-02T05:37:07.883505+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": 324
} | 2026-11-02T05:37:07.883505+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": 926
} | 2026-11-02T05:37:07.883505+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": 669
} | 2026-11-02T05:37:07.883505+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": 1972
} | 2026-11-02T05:37:07.883505+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": 4471
} | 2026-11-02T05:37:07.883505+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": 7604
} | 2026-11-02T05:37:07.883505+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": 14778
} | 2026-11-02T05:37:07.883505+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": 24909
} | 2026-11-02T05:37:07.883505+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": 1236
} | 2026-11-02T05:37:07.883505+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": 845
} | 2026-11-02T05:37:07.883505+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": 10300
} | 2026-11-02T05:37:07.883505+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": 4939
} | 2026-11-02T05:37:07.883505+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": 7404
} | 2026-11-02T05:37:07.883505+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": 35101
} | 2026-11-02T05:37:07.883505+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": 23534
} | 2026-11-02T05:37:07.883505+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": 1568
} | 2026-11-02T05:37:07.883505+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": 2841
} | 2026-11-02T05:37:07.883505+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": 2413
} | 2026-11-02T05:37:07.883505+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": 10474
} | 2026-11-02T05:37:07.883505+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": 8864
} | 2026-11-02T05:37:07.883505+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": 23159
} | 2026-11-02T05:37:07.883505+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": 33625
} | 2026-11-02T05:37:07.883505+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": 64861
} | 2026-11-02T05:37:07.883505+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": 2054
} | 2026-11-02T05:37:07.883505+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": 4849
} | 2026-11-02T05:37:07.883505+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": 7899
} | 2026-11-02T05:37:07.883505+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": 21295
} | 2026-11-02T05:37:07.883505+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": 35875
} | 2026-11-02T05:37:07.883505+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": 24059
} | 2026-11-02T05:37:07.883505+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": 35012
} | 2026-11-02T05:37:07.883505+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": 1091
} | 2026-11-02T05:37:07.883505+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": 2143
} | 2026-11-02T05:37:07.883505+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": 5291
} | 2026-11-02T05:37:07.883505+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": 16230
} | 2026-11-02T05:37:07.883505+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": 27728
} | 2026-11-02T05:37:07.883505+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": 17140
} | 2026-11-02T05:37:07.883505+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": 1431
} | 2026-11-02T05:37:07.883505+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": 475
} | 2026-11-02T05:37:07.883505+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": 794
} | 2026-11-02T05:37:07.883505+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": 2793
} | 2026-11-02T05:37:07.883505+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": 5794
} | 2026-11-02T05:37:07.883505+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": 13373
} | 2026-11-02T05:37:07.883505+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": 20881
} | 2026-11-02T05:37:07.883505+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": 24143
} | 2026-11-02T05:37:07.883505+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": 491
} | 2026-11-02T05:37:07.883505+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": 179
} | 2026-11-02T05:37:07.883505+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": 1224
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1615-E | codeforces | 1615-E | Purple Crayon | https://codeforces.com/problemset/problem/1615/E | [
"data structures",
"dfs and similar",
"games",
"graphs",
"greedy",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1784
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1615-D | codeforces | 1615-D | X(or)-mas Tree | https://codeforces.com/problemset/problem/1615/D | [
"bitmasks",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2233
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1615-C | codeforces | 1615-C | Menorah | https://codeforces.com/problemset/problem/1615/C | [
"brute force",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9400
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1615-B | codeforces | 1615-B | And It's Non-Zero | https://codeforces.com/problemset/problem/1615/B | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18362
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1615-A | codeforces | 1615-A | Closing The Gap | https://codeforces.com/problemset/problem/1615/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21769
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1614-E | codeforces | 1614-E | Divan and a Cottage | https://codeforces.com/problemset/problem/1614/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1013
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1614-D2 | codeforces | 1614-D2 | Divan and Kostomuksha (hard version) | https://codeforces.com/problemset/problem/1614/D2 | [
"dp",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2904
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1614-D1 | codeforces | 1614-D1 | Divan and Kostomuksha (easy version) | https://codeforces.com/problemset/problem/1614/D1 | [
"dp",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4653
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1614-C | codeforces | 1614-C | Divan and bitwise operations | https://codeforces.com/problemset/problem/1614/C | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11551
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1614-B | codeforces | 1614-B | Divan and a New Project | https://codeforces.com/problemset/problem/1614/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 32599
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1614-A | codeforces | 1614-A | Divan and a Store | https://codeforces.com/problemset/problem/1614/A | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24827
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1613-F | codeforces | 1613-F | Tree Coloring | https://codeforces.com/problemset/problem/1613/F | [
"combinatorics",
"divide and conquer",
"fft"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 933
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1613-E | codeforces | 1613-E | Crazy Robot | https://codeforces.com/problemset/problem/1613/E | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6107
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1613-D | codeforces | 1613-D | MEX Sequences | https://codeforces.com/problemset/problem/1613/D | [
"dp",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5464
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1613-C | codeforces | 1613-C | Poisoned Dagger | https://codeforces.com/problemset/problem/1613/C | [
"binary search"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 31999
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1613-B | codeforces | 1613-B | Absent Remainder | https://codeforces.com/problemset/problem/1613/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 23662
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1613-A | codeforces | 1613-A | Long Comparison | https://codeforces.com/problemset/problem/1613/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27046
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1612-G | codeforces | 1612-G | Max Sum Array | https://codeforces.com/problemset/problem/1612/G | [
"combinatorics",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1066
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1612-F | codeforces | 1612-F | Armor and Weapons | https://codeforces.com/problemset/problem/1612/F | [
"brute force",
"dp",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 767
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1612-E | codeforces | 1612-E | Messages | https://codeforces.com/problemset/problem/1612/E | [
"brute force",
"dp",
"greedy",
"probabilities",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2961
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1612-D | codeforces | 1612-D | X-Magic Pair | https://codeforces.com/problemset/problem/1612/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10508
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1612-C | codeforces | 1612-C | Chat Ban | https://codeforces.com/problemset/problem/1612/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 29524
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1612-B | codeforces | 1612-B | Special Permutation | https://codeforces.com/problemset/problem/1612/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18692
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1612-A | codeforces | 1612-A | Distance | https://codeforces.com/problemset/problem/1612/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18373
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1611-G | codeforces | 1611-G | Robot and Candies | https://codeforces.com/problemset/problem/1611/G | [
"data structures",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 801
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1611-F | codeforces | 1611-F | ATM and Students | https://codeforces.com/problemset/problem/1611/F | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7730
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1611-E2 | codeforces | 1611-E2 | Escape The Maze (hard version) | https://codeforces.com/problemset/problem/1611/E2 | [
"dfs and similar",
"dp",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4482
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1611-E1 | codeforces | 1611-E1 | Escape The Maze (easy version) | https://codeforces.com/problemset/problem/1611/E1 | [
"dfs and similar",
"greedy",
"shortest paths",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8654
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1611-D | codeforces | 1611-D | Weights Assignment For Tree Edges | https://codeforces.com/problemset/problem/1611/D | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11860
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1611-C | codeforces | 1611-C | Polycarp Recovers the Permutation | https://codeforces.com/problemset/problem/1611/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19604
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1611-B | codeforces | 1611-B | Team Composition: Programmers and Mathematicians | https://codeforces.com/problemset/problem/1611/B | [
"binary search",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32470
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1611-A | codeforces | 1611-A | Make Even | https://codeforces.com/problemset/problem/1611/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33891
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1610-I | codeforces | 1610-I | Mashtali vs AtCoder | https://codeforces.com/problemset/problem/1610/I | [
"games",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 489
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1610-H | codeforces | 1610-H | Squid Game | https://codeforces.com/problemset/problem/1610/H | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 792
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1610-G | codeforces | 1610-G | AmShZ Wins a Bet | https://codeforces.com/problemset/problem/1610/G | [
"data structures",
"greedy",
"hashing"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 676
} | 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.