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: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": 23322
} | 2026-08-10T02:20:32.917453+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": 1500
} | 2026-08-10T02:20:32.917453+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": 2805
} | 2026-08-10T02:20:32.917453+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": 2389
} | 2026-08-10T02:20:32.917453+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": 10356
} | 2026-08-10T02:20:32.917453+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": 8720
} | 2026-08-10T02:20:32.917453+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": 22967
} | 2026-08-10T02:20:32.917453+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": 33406
} | 2026-08-10T02:20:32.917453+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": 63918
} | 2026-08-10T02:20:32.917453+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": 1997
} | 2026-08-10T02:20:32.917453+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": 4810
} | 2026-08-10T02:20:32.917453+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": 7840
} | 2026-08-10T02:20:32.917453+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": 21114
} | 2026-08-10T02:20:32.917453+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": 34383
} | 2026-08-10T02:20:32.917453+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": 23958
} | 2026-08-10T02:20:32.917453+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": 34804
} | 2026-08-10T02:20:32.917453+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": 1076
} | 2026-08-10T02:20:32.917453+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": 2091
} | 2026-08-10T02:20:32.917453+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": 5247
} | 2026-08-10T02:20:32.917453+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": 16134
} | 2026-08-10T02:20:32.917453+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": 27341
} | 2026-08-10T02:20:32.917453+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": 17078
} | 2026-08-10T02:20:32.917453+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": 1383
} | 2026-08-10T02:20:32.917453+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": 474
} | 2026-08-10T02:20:32.917453+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": 787
} | 2026-08-10T02:20:32.917453+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": 2761
} | 2026-08-10T02:20:32.917453+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": 5697
} | 2026-08-10T02:20:32.917453+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": 13291
} | 2026-08-10T02:20:32.917453+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": 20815
} | 2026-08-10T02:20:32.917453+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": 24030
} | 2026-08-10T02:20:32.917453+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": 474
} | 2026-08-10T02:20:32.917453+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": 177
} | 2026-08-10T02:20:32.917453+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": 1201
} | 2026-08-10T02:20:32.917453+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": 1762
} | 2026-08-10T02:20:32.917453+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": 2190
} | 2026-08-10T02:20:32.917453+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": 9275
} | 2026-08-10T02:20:32.917453+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": 18155
} | 2026-08-10T02:20:32.917453+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": 21705
} | 2026-08-10T02:20:32.917453+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": 996
} | 2026-08-10T02:20:32.917453+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": 2802
} | 2026-08-10T02:20:32.917453+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": 4574
} | 2026-08-10T02:20:32.917453+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": 11439
} | 2026-08-10T02:20:32.917453+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": 31164
} | 2026-08-10T02:20:32.917453+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": 24724
} | 2026-08-10T02:20:32.917453+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": 909
} | 2026-08-10T02:20:32.917453+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": 5997
} | 2026-08-10T02:20:32.917453+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": 5365
} | 2026-08-10T02:20:32.917453+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": 30913
} | 2026-08-10T02:20:32.917453+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": 23493
} | 2026-08-10T02:20:32.917453+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": 26854
} | 2026-08-10T02:20:32.917453+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": 1043
} | 2026-08-10T02:20:32.917453+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": 754
} | 2026-08-10T02:20:32.917453+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": 2907
} | 2026-08-10T02:20:32.917453+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": 10383
} | 2026-08-10T02:20:32.917453+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": 27538
} | 2026-08-10T02:20:32.917453+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": 18588
} | 2026-08-10T02:20:32.917453+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": 18301
} | 2026-08-10T02:20:32.917453+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": 787
} | 2026-08-10T02:20:32.917453+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": 7582
} | 2026-08-10T02:20:32.917453+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": 4437
} | 2026-08-10T02:20:32.917453+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": 8554
} | 2026-08-10T02:20:32.917453+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": 11738
} | 2026-08-10T02:20:32.917453+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": 19503
} | 2026-08-10T02:20:32.917453+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": 32220
} | 2026-08-10T02:20:32.917453+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": 33640
} | 2026-08-10T02:20:32.917453+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": 485
} | 2026-08-10T02:20:32.917453+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": 783
} | 2026-08-10T02:20:32.917453+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": 670
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1610-F | codeforces | 1610-F | Mashtali: a Space Oddysey | https://codeforces.com/problemset/problem/1610/F | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 718
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1610-E | codeforces | 1610-E | AmShZ and G.O.A.T. | https://codeforces.com/problemset/problem/1610/E | [
"binary search",
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2113
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1610-D | codeforces | 1610-D | Not Quite Lee | https://codeforces.com/problemset/problem/1610/D | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3102
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1610-C | codeforces | 1610-C | Keshi Is Throwing a Party | https://codeforces.com/problemset/problem/1610/C | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16410
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1610-B | codeforces | 1610-B | Kalindrome Array | https://codeforces.com/problemset/problem/1610/B | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25081
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1610-A | codeforces | 1610-A | Anti Light's Cell Guessing | https://codeforces.com/problemset/problem/1610/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17175
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1609-H | codeforces | 1609-H | Pushing Robots | https://codeforces.com/problemset/problem/1609/H | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 109
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1609-G | codeforces | 1609-G | A Stroll Around the Matrix | https://codeforces.com/problemset/problem/1609/G | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 676
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1609-F | codeforces | 1609-F | Interesting Sections | https://codeforces.com/problemset/problem/1609/F | [
"data structures",
"divide and conquer",
"meet-in-the-middle",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1080
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1609-E | codeforces | 1609-E | William The Oblivious | https://codeforces.com/problemset/problem/1609/E | [
"bitmasks",
"data structures",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2514
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1609-D | codeforces | 1609-D | Social Network | https://codeforces.com/problemset/problem/1609/D | [
"dsu",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8593
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1609-C | codeforces | 1609-C | Complex Market Analysis | https://codeforces.com/problemset/problem/1609/C | [
"binary search",
"dp",
"implementation",
"number theory",
"schedules",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10557
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1609-B | codeforces | 1609-B | William the Vigilant | https://codeforces.com/problemset/problem/1609/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12195
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1609-A | codeforces | 1609-A | Divide and Multiply | https://codeforces.com/problemset/problem/1609/A | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19104
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1608-G | codeforces | 1608-G | Alphabetic Tree | https://codeforces.com/problemset/problem/1608/G | [
"binary search",
"data structures",
"dfs and similar",
"hashing",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 310
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1608-F | codeforces | 1608-F | MEX counting | https://codeforces.com/problemset/problem/1608/F | [
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 937
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1608-E | codeforces | 1608-E | The Cells on the Paper | https://codeforces.com/problemset/problem/1608/E | [
"binary search",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 530
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1608-D | codeforces | 1608-D | Dominoes | https://codeforces.com/problemset/problem/1608/D | [
"combinatorics",
"fft",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1626
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1608-C | codeforces | 1608-C | Game Master | https://codeforces.com/problemset/problem/1608/C | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7442
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1608-B | codeforces | 1608-B | Build the Permutation | https://codeforces.com/problemset/problem/1608/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12586
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1608-A | codeforces | 1608-A | Find Array | https://codeforces.com/problemset/problem/1608/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20389
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1607-H | codeforces | 1607-H | Banquet Preparations 2 | https://codeforces.com/problemset/problem/1607/H | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1474
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1607-G | codeforces | 1607-G | Banquet Preparations 1 | https://codeforces.com/problemset/problem/1607/G | [
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1775
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1607-F | codeforces | 1607-F | Robot on the Board 2 | https://codeforces.com/problemset/problem/1607/F | [
"brute force",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2168
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1607-E | codeforces | 1607-E | Robot on the Board 1 | https://codeforces.com/problemset/problem/1607/E | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10088
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1607-D | codeforces | 1607-D | Blue-Red Permutation | https://codeforces.com/problemset/problem/1607/D | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18272
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1607-C | codeforces | 1607-C | Minimum Extraction | https://codeforces.com/problemset/problem/1607/C | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27157
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1607-B | codeforces | 1607-B | Odd Grasshopper | https://codeforces.com/problemset/problem/1607/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 42221
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1607-A | codeforces | 1607-A | Linear Keyboard | https://codeforces.com/problemset/problem/1607/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41156
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1606-F | codeforces | 1606-F | Tree Queries | https://codeforces.com/problemset/problem/1606/F | [
"brute force",
"dp",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 817
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1606-E | codeforces | 1606-E | Arena | https://codeforces.com/problemset/problem/1606/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4313
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1606-D | codeforces | 1606-D | Red-Blue Matrix | https://codeforces.com/problemset/problem/1606/D | [
"brute force",
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1618
} | 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.