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:1903-D1 | codeforces | 1903-D1 | Maximum And Queries (easy version) | https://codeforces.com/problemset/problem/1903/D1 | [
"binary search",
"bitmasks",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7540
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1903-C | codeforces | 1903-C | Theofanis' Nightmare | https://codeforces.com/problemset/problem/1903/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15057
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1903-B | codeforces | 1903-B | StORage room | https://codeforces.com/problemset/problem/1903/B | [
"bitmasks",
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15244
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1903-A | codeforces | 1903-A | Halloumi Boxes | https://codeforces.com/problemset/problem/1903/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 95558
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1902-F | codeforces | 1902-F | Trees and XOR Queries Again | https://codeforces.com/problemset/problem/1902/F | [
"data structures",
"dfs and similar",
"divide and conquer",
"graphs",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1609
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1902-E | codeforces | 1902-E | Collapsing Strings | https://codeforces.com/problemset/problem/1902/E | [
"data structures",
"strings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6176
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1902-D | codeforces | 1902-D | Robot Queries | https://codeforces.com/problemset/problem/1902/D | [
"binary search",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5632
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1902-C | codeforces | 1902-C | Insert and Equalize | https://codeforces.com/problemset/problem/1902/C | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17918
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1902-B | codeforces | 1902-B | Getting Points | https://codeforces.com/problemset/problem/1902/B | [
"binary search",
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16824
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1902-A | codeforces | 1902-A | Binary Imbalance | https://codeforces.com/problemset/problem/1902/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23523
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1901-F | codeforces | 1901-F | Landscaping | https://codeforces.com/problemset/problem/1901/F | [
"binary search",
"geometry",
"two pointers"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 285
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1901-E | codeforces | 1901-E | Compressed Tree | https://codeforces.com/problemset/problem/1901/E | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2093
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1901-D | codeforces | 1901-D | Yet Another Monster Fight | https://codeforces.com/problemset/problem/1901/D | [
"binary search",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8914
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1901-C | codeforces | 1901-C | Add, Divide and Floor | https://codeforces.com/problemset/problem/1901/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14779
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1901-B | codeforces | 1901-B | Chip and Ribbon | https://codeforces.com/problemset/problem/1901/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17379
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1901-A | codeforces | 1901-A | Line Trip | https://codeforces.com/problemset/problem/1901/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 89927
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1900-F | codeforces | 1900-F | Local Deletions | https://codeforces.com/problemset/problem/1900/F | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 415
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1900-E | codeforces | 1900-E | Transitive Graph | https://codeforces.com/problemset/problem/1900/E | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2818
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1900-D | codeforces | 1900-D | Small GCD | https://codeforces.com/problemset/problem/1900/D | [
"bitmasks",
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5793
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1900-C | codeforces | 1900-C | Anji's Binary Tree | https://codeforces.com/problemset/problem/1900/C | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15684
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1900-B | codeforces | 1900-B | Laura and Operations | https://codeforces.com/problemset/problem/1900/B | [
"dp",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21171
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1900-A | codeforces | 1900-A | Cover in Water | https://codeforces.com/problemset/problem/1900/A | [
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 76922
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1899-G | codeforces | 1899-G | Unusual Entertainment | https://codeforces.com/problemset/problem/1899/G | [
"data structures",
"dfs and similar",
"dsu",
"shortest paths",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4208
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1899-F | codeforces | 1899-F | Alex's whims | https://codeforces.com/problemset/problem/1899/F | [
"constructive algorithms",
"graphs",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9860
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1899-E | codeforces | 1899-E | Queue Sort | https://codeforces.com/problemset/problem/1899/E | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18839
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1899-D | codeforces | 1899-D | Yarik and Musical Notes | https://codeforces.com/problemset/problem/1899/D | [
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16107
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1899-C | codeforces | 1899-C | Yarik and Array | https://codeforces.com/problemset/problem/1899/C | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 39655
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1899-B | codeforces | 1899-B | 250 Thousand Tons of TNT | https://codeforces.com/problemset/problem/1899/B | [
"brute force",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 37443
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1899-A | codeforces | 1899-A | Game with Integers | https://codeforces.com/problemset/problem/1899/A | [
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 108944
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1898-F | codeforces | 1898-F | Vova Escapes the Matrix | https://codeforces.com/problemset/problem/1898/F | [
"brute force",
"dfs and similar",
"divide and conquer",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1046
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1898-E | codeforces | 1898-E | Sofia and Strings | https://codeforces.com/problemset/problem/1898/E | [
"data structures",
"greedy",
"sortings",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2865
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1898-D | codeforces | 1898-D | Absolute Beauty | https://codeforces.com/problemset/problem/1898/D | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7037
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1898-C | codeforces | 1898-C | Colorful Grid | https://codeforces.com/problemset/problem/1898/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6689
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1898-B | codeforces | 1898-B | Milena and Admirer | https://codeforces.com/problemset/problem/1898/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15057
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1898-A | codeforces | 1898-A | Milica and String | https://codeforces.com/problemset/problem/1898/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17623
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1896-H2 | codeforces | 1896-H2 | Cyclic Hamming (Hard Version) | https://codeforces.com/problemset/problem/1896/H2 | [
"brute force",
"dp",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 177
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1896-H1 | codeforces | 1896-H1 | Cyclic Hamming (Easy Version) | https://codeforces.com/problemset/problem/1896/H1 | [
"brute force",
"divide and conquer",
"dp",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 217
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1896-G | codeforces | 1896-G | Pepe Racing | https://codeforces.com/problemset/problem/1896/G | [
"constructive algorithms",
"implementation",
"interactive",
"sortings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 507
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1896-F | codeforces | 1896-F | Bracket Xoring | https://codeforces.com/problemset/problem/1896/F | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1037
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1896-E | codeforces | 1896-E | Permutation Sorting | https://codeforces.com/problemset/problem/1896/E | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2829
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1896-D | codeforces | 1896-D | Ones and Twos | https://codeforces.com/problemset/problem/1896/D | [
"binary search",
"data structures",
"divide and conquer",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7207
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1896-C | codeforces | 1896-C | Matching Arrays | https://codeforces.com/problemset/problem/1896/C | [
"binary search",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12114
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1896-B | codeforces | 1896-B | AB Flipping | https://codeforces.com/problemset/problem/1896/B | [
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19215
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1896-A | codeforces | 1896-A | Jagged Swaps | https://codeforces.com/problemset/problem/1896/A | [
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 69045
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1895-G | codeforces | 1895-G | Two Characters, Two Colors | https://codeforces.com/problemset/problem/1895/G | [
"binary search",
"data structures",
"dp",
"flows",
"greedy"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 503
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1895-F | codeforces | 1895-F | Fancy Arrays | https://codeforces.com/problemset/problem/1895/F | [
"combinatorics",
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1145
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1895-E | codeforces | 1895-E | Infinite Card Game | https://codeforces.com/problemset/problem/1895/E | [
"binary search",
"brute force",
"data structures",
"dfs and similar",
"dp",
"dsu",
"games",
"graphs",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1974
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1895-D | codeforces | 1895-D | XOR Construction | https://codeforces.com/problemset/problem/1895/D | [
"bitmasks",
"constructive algorithms",
"data structures",
"math",
"string suffix structures",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7353
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1895-C | codeforces | 1895-C | Torn Lucky Ticket | https://codeforces.com/problemset/problem/1895/C | [
"brute force",
"dp",
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13417
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1895-B | codeforces | 1895-B | Points and Minimum Distance | https://codeforces.com/problemset/problem/1895/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21800
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1895-A | codeforces | 1895-A | Treasure Chest | https://codeforces.com/problemset/problem/1895/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26278
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1894-B | codeforces | 1894-B | Two Out of Three | https://codeforces.com/problemset/problem/1894/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18455
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1894-A | codeforces | 1894-A | Secret Sport | https://codeforces.com/problemset/problem/1894/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20633
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1893-E | codeforces | 1893-E | Cacti Symphony | https://codeforces.com/problemset/problem/1893/E | [
"combinatorics",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 390
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1893-D | codeforces | 1893-D | Colorful Constructive | https://codeforces.com/problemset/problem/1893/D | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1155
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1893-C | codeforces | 1893-C | Freedom of Choice | https://codeforces.com/problemset/problem/1893/C | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3298
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1893-B | codeforces | 1893-B | Neutral Tonality | https://codeforces.com/problemset/problem/1893/B | [
"constructive algorithms",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12163
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1893-A | codeforces | 1893-A | Anonymous Informant | https://codeforces.com/problemset/problem/1893/A | [
"brute force",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15506
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1891-F | codeforces | 1891-F | A Growing Tree | https://codeforces.com/problemset/problem/1891/F | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5086
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1891-E | codeforces | 1891-E | Brukhovich and Exams | https://codeforces.com/problemset/problem/1891/E | [
"brute force",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1146
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1891-D | codeforces | 1891-D | Suspicious logarithms | https://codeforces.com/problemset/problem/1891/D | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4657
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1891-C | codeforces | 1891-C | Smilo and Monsters | https://codeforces.com/problemset/problem/1891/C | [
"binary search",
"constructive algorithms",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 22731
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1891-B | codeforces | 1891-B | Deja Vu | https://codeforces.com/problemset/problem/1891/B | [
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 32672
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1891-A | codeforces | 1891-A | Sorting with Twos | https://codeforces.com/problemset/problem/1891/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20754
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1890-B | codeforces | 1890-B | Qingshan Loves Strings | https://codeforces.com/problemset/problem/1890/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18987
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1890-A | codeforces | 1890-A | Doremy's Paint 3 | https://codeforces.com/problemset/problem/1890/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 67406
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1889-F | codeforces | 1889-F | Doremy's Average Tree | https://codeforces.com/problemset/problem/1889/F | [
"data structures",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 226
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1889-E | codeforces | 1889-E | Doremy's Swapping Trees | https://codeforces.com/problemset/problem/1889/E | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 192
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1889-D | codeforces | 1889-D | Game of Stacks | https://codeforces.com/problemset/problem/1889/D | [
"brute force",
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1026
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1889-C2 | codeforces | 1889-C2 | Doremy's Drying Plan (Hard Version) | https://codeforces.com/problemset/problem/1889/C2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1250
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1889-C1 | codeforces | 1889-C1 | Doremy's Drying Plan (Easy Version) | https://codeforces.com/problemset/problem/1889/C1 | [
"brute force",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4034
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1889-B | codeforces | 1889-B | Doremy's Connecting Plan | https://codeforces.com/problemset/problem/1889/B | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8820
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1889-A | codeforces | 1889-A | Qingshan Loves Strings 2 | https://codeforces.com/problemset/problem/1889/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15714
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1887-F | codeforces | 1887-F | Minimum Segments | https://codeforces.com/problemset/problem/1887/F | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 289
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1887-E | codeforces | 1887-E | Good Colorings | https://codeforces.com/problemset/problem/1887/E | [
"binary search",
"constructive algorithms",
"graphs",
"interactive"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 582
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1887-D | codeforces | 1887-D | Split | https://codeforces.com/problemset/problem/1887/D | [
"binary search",
"data structures",
"divide and conquer",
"dsu",
"math",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1434
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1887-C | codeforces | 1887-C | Minimum Array | https://codeforces.com/problemset/problem/1887/C | [
"binary search",
"brute force",
"constructive algorithms",
"data structures",
"greedy",
"hashing",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2427
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1887-B | codeforces | 1887-B | Time Travel | https://codeforces.com/problemset/problem/1887/B | [
"binary search",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4133
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1886-F | codeforces | 1886-F | Diamond Theft | https://codeforces.com/problemset/problem/1886/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 277
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1886-E | codeforces | 1886-E | I Wanna be the Team Leader | https://codeforces.com/problemset/problem/1886/E | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1954
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1886-D | codeforces | 1886-D | Monocarp and the Set | https://codeforces.com/problemset/problem/1886/D | [
"combinatorics",
"data structures",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4316
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1886-C | codeforces | 1886-C | Decreasing String | https://codeforces.com/problemset/problem/1886/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 18145
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1886-B | codeforces | 1886-B | Fear of the Dark | https://codeforces.com/problemset/problem/1886/B | [
"binary search",
"geometry",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18460
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1886-A | codeforces | 1886-A | Sum of Three | https://codeforces.com/problemset/problem/1886/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28030
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1885-A | codeforces | 1885-A | Deterministic Scheduling for Extended Reality over 5G and Beyond | https://codeforces.com/problemset/problem/1885/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1884-E | codeforces | 1884-E | Hard Design | https://codeforces.com/problemset/problem/1884/E | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 457
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1884-D | codeforces | 1884-D | Counting Rhyme | https://codeforces.com/problemset/problem/1884/D | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4385
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1884-C | codeforces | 1884-C | Medium Design | https://codeforces.com/problemset/problem/1884/C | [
"brute force",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7680
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1884-B | codeforces | 1884-B | Haunted House | https://codeforces.com/problemset/problem/1884/B | [
"binary search",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15101
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1884-A | codeforces | 1884-A | Simple Design | https://codeforces.com/problemset/problem/1884/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19399
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1883-G2 | codeforces | 1883-G2 | Dances (Hard Version) | https://codeforces.com/problemset/problem/1883/G2 | [
"binary search",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7072
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1883-G1 | codeforces | 1883-G1 | Dances (Easy version) | https://codeforces.com/problemset/problem/1883/G1 | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 22130
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1883-F | codeforces | 1883-F | You Are So Beautiful | https://codeforces.com/problemset/problem/1883/F | [
"data structures"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12340
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1883-E | codeforces | 1883-E | Look Back | https://codeforces.com/problemset/problem/1883/E | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10281
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1883-D | codeforces | 1883-D | In Love | https://codeforces.com/problemset/problem/1883/D | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15065
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1883-C | codeforces | 1883-C | Raspberries | https://codeforces.com/problemset/problem/1883/C | [
"dp",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 57915
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1883-B | codeforces | 1883-B | Chemistry | https://codeforces.com/problemset/problem/1883/B | [
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 68605
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1883-A | codeforces | 1883-A | Morning | https://codeforces.com/problemset/problem/1883/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30100
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1882-E2 | codeforces | 1882-E2 | Two Permutations (Hard Version) | https://codeforces.com/problemset/problem/1882/E2 | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 444
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1882-E1 | codeforces | 1882-E1 | Two Permutations (Easy Version) | https://codeforces.com/problemset/problem/1882/E1 | [
"brute force",
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1450
} | 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.