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:1703-C | codeforces | 1703-C | Cypher | https://codeforces.com/problemset/problem/1703/C | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40984
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1703-B | codeforces | 1703-B | ICPC Balloons | https://codeforces.com/problemset/problem/1703/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 66678
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1703-A | codeforces | 1703-A | YES or YES? | https://codeforces.com/problemset/problem/1703/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 98182
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1702-G2 | codeforces | 1702-G2 | Passable Paths (hard version) | https://codeforces.com/problemset/problem/1702/G2 | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5853
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1702-G1 | codeforces | 1702-G1 | Passable Paths (easy version) | https://codeforces.com/problemset/problem/1702/G1 | [
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6405
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1702-F | codeforces | 1702-F | Equate Multisets | https://codeforces.com/problemset/problem/1702/F | [
"constructive algorithms",
"data structures",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9513
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1702-E | codeforces | 1702-E | Split Into Two Sets | https://codeforces.com/problemset/problem/1702/E | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18125
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1702-D | codeforces | 1702-D | Not a Cheap String | https://codeforces.com/problemset/problem/1702/D | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26035
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1702-C | codeforces | 1702-C | Train and Queries | https://codeforces.com/problemset/problem/1702/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25268
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1702-B | codeforces | 1702-B | Polycarp Writes a String from Memory | https://codeforces.com/problemset/problem/1702/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29395
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1702-A | codeforces | 1702-A | Round Down the Price | https://codeforces.com/problemset/problem/1702/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38321
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1701-F | codeforces | 1701-F | Points | https://codeforces.com/problemset/problem/1701/F | [
"combinatorics",
"data structures",
"implementation",
"math",
"matrices"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1140
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1701-E | codeforces | 1701-E | Text Editor | https://codeforces.com/problemset/problem/1701/E | [
"brute force",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1353
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1701-D | codeforces | 1701-D | Permutation Restoration | https://codeforces.com/problemset/problem/1701/D | [
"binary search",
"data structures",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6284
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1701-C | codeforces | 1701-C | Schedule Management | https://codeforces.com/problemset/problem/1701/C | [
"binary search",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 24193
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1701-B | codeforces | 1701-B | Permutation | https://codeforces.com/problemset/problem/1701/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20822
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1701-A | codeforces | 1701-A | Grass Field | https://codeforces.com/problemset/problem/1701/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27571
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1700-F | codeforces | 1700-F | Puzzle | https://codeforces.com/problemset/problem/1700/F | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1064
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1700-E | codeforces | 1700-E | Serega the Pirate | https://codeforces.com/problemset/problem/1700/E | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 961
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1700-D | codeforces | 1700-D | River Locks | https://codeforces.com/problemset/problem/1700/D | [
"binary search",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7046
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1700-C | codeforces | 1700-C | Helping the Nature | https://codeforces.com/problemset/problem/1700/C | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12218
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1700-B | codeforces | 1700-B | Palindromic Numbers | https://codeforces.com/problemset/problem/1700/B | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19924
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1700-A | codeforces | 1700-A | Optimal Path | https://codeforces.com/problemset/problem/1700/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23704
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1699-E | codeforces | 1699-E | Three Days Grace | https://codeforces.com/problemset/problem/1699/E | [
"data structures",
"dp",
"greedy",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1386
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1699-D | codeforces | 1699-D | Almost Triple Deletions | https://codeforces.com/problemset/problem/1699/D | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3529
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1699-C | codeforces | 1699-C | The Third Problem | https://codeforces.com/problemset/problem/1699/C | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10768
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1699-B | codeforces | 1699-B | Almost Ternary Matrix | https://codeforces.com/problemset/problem/1699/B | [
"bitmasks",
"constructive algorithms",
"matrices"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21785
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1699-A | codeforces | 1699-A | The Third Three Number Problem | https://codeforces.com/problemset/problem/1699/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24845
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1698-G | codeforces | 1698-G | Long Binary String | https://codeforces.com/problemset/problem/1698/G | [
"bitmasks",
"math",
"matrices",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 384
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1698-F | codeforces | 1698-F | Equal Reversal | https://codeforces.com/problemset/problem/1698/F | [
"constructive algorithms",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 760
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1698-E | codeforces | 1698-E | PermutationForces II | https://codeforces.com/problemset/problem/1698/E | [
"brute force",
"combinatorics",
"greedy",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1794
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1698-D | codeforces | 1698-D | Fixed Point Guessing | https://codeforces.com/problemset/problem/1698/D | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12206
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1698-C | codeforces | 1698-C | 3SUM Closure | https://codeforces.com/problemset/problem/1698/C | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19793
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1698-B | codeforces | 1698-B | Rising Sand | https://codeforces.com/problemset/problem/1698/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21482
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1698-A | codeforces | 1698-A | XOR Mixup | https://codeforces.com/problemset/problem/1698/A | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32997
} | 2026-06-01T05:00:40.145500+00:00 |
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": 731
} | 2026-06-01T05:00:40.145500+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": 1452
} | 2026-06-01T05:00:40.145500+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": 5011
} | 2026-06-01T05:00:40.145500+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": 15838
} | 2026-06-01T05:00:40.145500+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": 31030
} | 2026-06-01T05:00:40.145500+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": 26767
} | 2026-06-01T05:00:40.145500+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": 204
} | 2026-06-01T05:00:40.145500+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": 322
} | 2026-06-01T05:00:40.145500+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": 1144
} | 2026-06-01T05:00:40.145500+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": 4944
} | 2026-06-01T05:00:40.145500+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": 6029
} | 2026-06-01T05:00:40.145500+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": 12596
} | 2026-06-01T05:00:40.145500+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": 37107
} | 2026-06-01T05:00:40.145500+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": 20309
} | 2026-06-01T05:00:40.145500+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": 514
} | 2026-06-01T05:00:40.145500+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": 2301
} | 2026-06-01T05:00:40.145500+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": 2465
} | 2026-06-01T05:00:40.145500+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": 14175
} | 2026-06-01T05:00:40.145500+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": 20025
} | 2026-06-01T05:00:40.145500+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": 16814
} | 2026-06-01T05:00:40.145500+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": 20697
} | 2026-06-01T05:00:40.145500+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": 23564
} | 2026-06-01T05:00:40.145500+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": 616
} | 2026-06-01T05:00:40.145500+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": 559
} | 2026-06-01T05:00:40.145500+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": 1112
} | 2026-06-01T05:00:40.145500+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": 3203
} | 2026-06-01T05:00:40.145500+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": 9642
} | 2026-06-01T05:00:40.145500+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": 17502
} | 2026-06-01T05:00:40.145500+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": 9709
} | 2026-06-01T05:00:40.145500+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": 26792
} | 2026-06-01T05:00:40.145500+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": 27419
} | 2026-06-01T05:00:40.145500+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": 33925
} | 2026-06-01T05:00:40.145500+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": 21717
} | 2026-06-01T05:00:40.145500+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": 39069
} | 2026-06-01T05:00:40.145500+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": 39584
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1692-A | codeforces | 1692-A | Marathon | https://codeforces.com/problemset/problem/1692/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 86374
} | 2026-06-01T05:00:40.145500+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": 1138
} | 2026-06-01T05:00:40.145500+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": 2105
} | 2026-06-01T05:00:40.145500+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": 7545
} | 2026-06-01T05:00:40.145500+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": 17287
} | 2026-06-01T05:00:40.145500+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": 35937
} | 2026-06-01T05:00:40.145500+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": 32241
} | 2026-06-01T05:00:40.145500+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": 4149
} | 2026-06-01T05:00:40.145500+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": 8960
} | 2026-06-01T05:00:40.145500+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": 17067
} | 2026-06-01T05:00:40.145500+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": 47955
} | 2026-06-01T05:00:40.145500+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": 28143
} | 2026-06-01T05:00:40.145500+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": 26971
} | 2026-06-01T05:00:40.145500+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": 35692
} | 2026-06-01T05:00:40.145500+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": 1367
} | 2026-06-01T05:00:40.145500+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": 4767
} | 2026-06-01T05:00:40.145500+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": 13591
} | 2026-06-01T05:00:40.145500+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": 19098
} | 2026-06-01T05:00:40.145500+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": 17745
} | 2026-06-01T05:00:40.145500+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": 8781
} | 2026-06-01T05:00:40.145500+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": 19069
} | 2026-06-01T05:00:40.145500+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": 23582
} | 2026-06-01T05:00:40.145500+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": 109
} | 2026-06-01T05:00:40.145500+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": 313
} | 2026-06-01T05:00:40.145500+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": 737
} | 2026-06-01T05:00:40.145500+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": 1693
} | 2026-06-01T05:00:40.145500+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": 4152
} | 2026-06-01T05:00:40.145500+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": 11454
} | 2026-06-01T05:00:40.145500+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": 19403
} | 2026-06-01T05:00:40.145500+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": 21254
} | 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.