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:1832-D2 | codeforces | 1832-D2 | Red-Blue Operations (Hard Version) | https://codeforces.com/problemset/problem/1832/D2 | [
"binary search",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2453
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1832-D1 | codeforces | 1832-D1 | Red-Blue Operations (Easy Version) | https://codeforces.com/problemset/problem/1832/D1 | [
"binary search",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3510
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1832-C | codeforces | 1832-C | Contrast Value | https://codeforces.com/problemset/problem/1832/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 38706
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1832-B | codeforces | 1832-B | Maximum Sum | https://codeforces.com/problemset/problem/1832/B | [
"brute force",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 40330
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1832-A | codeforces | 1832-A | New Palindrome | https://codeforces.com/problemset/problem/1832/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29771
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1831-B | codeforces | 1831-B | Array merging | https://codeforces.com/problemset/problem/1831/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 40242
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1831-A | codeforces | 1831-A | Twin Permutations | https://codeforces.com/problemset/problem/1831/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 52906
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1830-F | codeforces | 1830-F | The Third Grace | https://codeforces.com/problemset/problem/1830/F | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 425
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1830-E | codeforces | 1830-E | Bully Sort | https://codeforces.com/problemset/problem/1830/E | [
"data structures",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 354
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1830-D | codeforces | 1830-D | Mex Tree | https://codeforces.com/problemset/problem/1830/D | [
"brute force",
"dp",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1029
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1830-C | codeforces | 1830-C | Hyperregular Bracket Strings | https://codeforces.com/problemset/problem/1830/C | [
"combinatorics",
"greedy",
"hashing",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2415
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1830-B | codeforces | 1830-B | The BOSS Can Count Pairs | https://codeforces.com/problemset/problem/1830/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6085
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1830-A | codeforces | 1830-A | Copil Copac Draws Trees | https://codeforces.com/problemset/problem/1830/A | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 22359
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1829-H | codeforces | 1829-H | Don't Blame Me | https://codeforces.com/problemset/problem/1829/H | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11759
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1829-G | codeforces | 1829-G | Hits Different | https://codeforces.com/problemset/problem/1829/G | [
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16678
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1829-F | codeforces | 1829-F | Forever Winter | https://codeforces.com/problemset/problem/1829/F | [
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22865
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1829-E | codeforces | 1829-E | The Lakes | https://codeforces.com/problemset/problem/1829/E | [
"dfs and similar",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28705
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1829-D | codeforces | 1829-D | Gold Rush | https://codeforces.com/problemset/problem/1829/D | [
"brute force",
"dfs and similar",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 36159
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1829-C | codeforces | 1829-C | Mr. Perfectly Fine | https://codeforces.com/problemset/problem/1829/C | [
"bitmasks",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33389
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1829-B | codeforces | 1829-B | Blank Space | https://codeforces.com/problemset/problem/1829/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 88737
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1829-A | codeforces | 1829-A | Love Story | https://codeforces.com/problemset/problem/1829/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 75057
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1828-B | codeforces | 1828-B | Permutation Swap | https://codeforces.com/problemset/problem/1828/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 44759
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1828-A | codeforces | 1828-A | Divisible Array | https://codeforces.com/problemset/problem/1828/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25668
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1827-F | codeforces | 1827-F | Copium Permutation | https://codeforces.com/problemset/problem/1827/F | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 142
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1827-E | codeforces | 1827-E | Bus Routes | https://codeforces.com/problemset/problem/1827/E | [
"binary search",
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 1211
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1827-D | codeforces | 1827-D | Two Centroids | https://codeforces.com/problemset/problem/1827/D | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1084
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1827-C | codeforces | 1827-C | Palindrome Partition | https://codeforces.com/problemset/problem/1827/C | [
"binary search",
"brute force",
"data structures",
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1822
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1827-B2 | codeforces | 1827-B2 | Range Sorting (Hard Version) | https://codeforces.com/problemset/problem/1827/B2 | [
"binary search",
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2436
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1827-B1 | codeforces | 1827-B1 | Range Sorting (Easy Version) | https://codeforces.com/problemset/problem/1827/B1 | [
"binary search",
"dp",
"dsu",
"greedy",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4692
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1827-A | codeforces | 1827-A | Counting Orders | https://codeforces.com/problemset/problem/1827/A | [
"combinatorics",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 32209
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1826-F | codeforces | 1826-F | Fading into Fog | https://codeforces.com/problemset/problem/1826/F | [
"geometry",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 494
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1826-E | codeforces | 1826-E | Walk the Runway | https://codeforces.com/problemset/problem/1826/E | [
"bitmasks",
"brute force",
"data structures",
"dp",
"graphs",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2070
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1826-D | codeforces | 1826-D | Running Miles | https://codeforces.com/problemset/problem/1826/D | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 16605
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1826-C | codeforces | 1826-C | Dreaming of Freedom | https://codeforces.com/problemset/problem/1826/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16094
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1826-B | codeforces | 1826-B | Lunatic Never Content | https://codeforces.com/problemset/problem/1826/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 31591
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1826-A | codeforces | 1826-A | Trust Nobody | https://codeforces.com/problemset/problem/1826/A | [
"brute force",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17662
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1825-B | codeforces | 1825-B | LuoTianyi and the Table | https://codeforces.com/problemset/problem/1825/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16425
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1825-A | codeforces | 1825-A | LuoTianyi and the Palindrome String | https://codeforces.com/problemset/problem/1825/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21064
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1824-E | codeforces | 1824-E | LuoTianyi and Cartridge | https://codeforces.com/problemset/problem/1824/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 199
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1824-D | codeforces | 1824-D | LuoTianyi and the Function | https://codeforces.com/problemset/problem/1824/D | [
"data structures"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 880
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1824-C | codeforces | 1824-C | LuoTianyi and XOR-Tree | https://codeforces.com/problemset/problem/1824/C | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1781
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1824-B2 | codeforces | 1824-B2 | LuoTianyi and the Floating Islands (Hard Version) | https://codeforces.com/problemset/problem/1824/B2 | [
"combinatorics",
"dfs and similar",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3686
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1824-B1 | codeforces | 1824-B1 | LuoTianyi and the Floating Islands (Easy Version) | https://codeforces.com/problemset/problem/1824/B1 | [
"combinatorics",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6542
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1824-A | codeforces | 1824-A | LuoTianyi and the Show | https://codeforces.com/problemset/problem/1824/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12758
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1823-F | codeforces | 1823-F | Random Walk | https://codeforces.com/problemset/problem/1823/F | [
"dp",
"graphs",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1442
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1823-E | codeforces | 1823-E | Removing Graph | https://codeforces.com/problemset/problem/1823/E | [
"brute force",
"dp",
"games",
"graphs",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1524
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1823-D | codeforces | 1823-D | Unique Palindromes | https://codeforces.com/problemset/problem/1823/D | [
"constructive algorithms",
"math",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4404
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1823-C | codeforces | 1823-C | Strongly Composite | https://codeforces.com/problemset/problem/1823/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14086
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1823-B | codeforces | 1823-B | Sort with Step | https://codeforces.com/problemset/problem/1823/B | [
"brute force",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18448
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1823-A | codeforces | 1823-A | A-characteristic | https://codeforces.com/problemset/problem/1823/A | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17414
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1822-G2 | codeforces | 1822-G2 | Magic Triples (Hard Version) | https://codeforces.com/problemset/problem/1822/G2 | [
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3202
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1822-G1 | codeforces | 1822-G1 | Magic Triples (Easy Version) | https://codeforces.com/problemset/problem/1822/G1 | [
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10218
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1822-F | codeforces | 1822-F | Gardening Friends | https://codeforces.com/problemset/problem/1822/F | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8014
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1822-E | codeforces | 1822-E | Making Anti-Palindromes | https://codeforces.com/problemset/problem/1822/E | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12753
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1822-D | codeforces | 1822-D | Super-Permutation | https://codeforces.com/problemset/problem/1822/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19407
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1822-C | codeforces | 1822-C | Bun Lover | https://codeforces.com/problemset/problem/1822/C | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25163
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1822-B | codeforces | 1822-B | Karina and Array | https://codeforces.com/problemset/problem/1822/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26840
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1822-A | codeforces | 1822-A | TubeTube Feed | https://codeforces.com/problemset/problem/1822/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26342
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1821-F | codeforces | 1821-F | Timber | https://codeforces.com/problemset/problem/1821/F | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1049
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1821-E | codeforces | 1821-E | Rearrange Brackets | https://codeforces.com/problemset/problem/1821/E | [
"brute force",
"dp",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2818
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1821-D | codeforces | 1821-D | Black Cells | https://codeforces.com/problemset/problem/1821/D | [
"binary search",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5669
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1821-C | codeforces | 1821-C | Tear It Apart | https://codeforces.com/problemset/problem/1821/C | [
"brute force",
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16606
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1821-B | codeforces | 1821-B | Sort the Subarray | https://codeforces.com/problemset/problem/1821/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 31743
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1821-A | codeforces | 1821-A | Matching | https://codeforces.com/problemset/problem/1821/A | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21548
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1820-B | codeforces | 1820-B | JoJo's Incredible Adventures | https://codeforces.com/problemset/problem/1820/B | [
"math",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25818
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1820-A | codeforces | 1820-A | Yura's New Name | https://codeforces.com/problemset/problem/1820/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17851
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1819-F | codeforces | 1819-F | Willy-nilly, Crack, Into Release! | https://codeforces.com/problemset/problem/1819/F | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 224
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1819-E | codeforces | 1819-E | Roads in E City | https://codeforces.com/problemset/problem/1819/E | [
"interactive",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 392
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1819-D | codeforces | 1819-D | Misha and Apples | https://codeforces.com/problemset/problem/1819/D | [
"brute force",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 972
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1819-C | codeforces | 1819-C | The Fox and the Complete Tree Traversal | https://codeforces.com/problemset/problem/1819/C | [
"constructive algorithms",
"dp",
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1801
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1819-B | codeforces | 1819-B | The Butcher | https://codeforces.com/problemset/problem/1819/B | [
"geometry",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4411
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1819-A | codeforces | 1819-A | Constructive Problem | https://codeforces.com/problemset/problem/1819/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14905
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1818-B | codeforces | 1818-B | Indivisible | https://codeforces.com/problemset/problem/1818/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17456
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1818-A | codeforces | 1818-A | Politics | https://codeforces.com/problemset/problem/1818/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14849
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1817-F | codeforces | 1817-F | Entangled Substrings | https://codeforces.com/problemset/problem/1817/F | [
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 446
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1817-E | codeforces | 1817-E | Half-sum | https://codeforces.com/problemset/problem/1817/E | [
"brute force",
"divide and conquer",
"greedy"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 392
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1817-D | codeforces | 1817-D | Toy Machine | https://codeforces.com/problemset/problem/1817/D | [
"constructive algorithms",
"games",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1078
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1817-C | codeforces | 1817-C | Similar Polynomials | https://codeforces.com/problemset/problem/1817/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1270
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1817-B | codeforces | 1817-B | Fish Graph | https://codeforces.com/problemset/problem/1817/B | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5384
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1817-A | codeforces | 1817-A | Almost Increasing Subsequence | https://codeforces.com/problemset/problem/1817/A | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13030
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1816-B | codeforces | 1816-B | Grid Reconstruction | https://codeforces.com/problemset/problem/1816/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 16998
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1816-A | codeforces | 1816-A | Ian Visits Mary | https://codeforces.com/problemset/problem/1816/A | [
"constructive algorithms",
"geometry",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19177
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1815-F | codeforces | 1815-F | OH NO1 (-2-3-4) | https://codeforces.com/problemset/problem/1815/F | [
"constructive algorithms",
"graphs",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 341
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1815-E | codeforces | 1815-E | Bosco and Particle | https://codeforces.com/problemset/problem/1815/E | [
"dp",
"math",
"number theory",
"strings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 501
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1815-D | codeforces | 1815-D | XOR Counting | https://codeforces.com/problemset/problem/1815/D | [
"bitmasks",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1584
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1815-C | codeforces | 1815-C | Between | https://codeforces.com/problemset/problem/1815/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2455
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1815-B | codeforces | 1815-B | Sum Graph | https://codeforces.com/problemset/problem/1815/B | [
"brute force",
"constructive algorithms",
"graphs",
"implementation",
"interactive",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3751
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1815-A | codeforces | 1815-A | Ian and Array Sorting | https://codeforces.com/problemset/problem/1815/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16349
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1814-F | codeforces | 1814-F | Communication Towers | https://codeforces.com/problemset/problem/1814/F | [
"brute force",
"divide and conquer",
"dsu"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1060
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1814-E | codeforces | 1814-E | Chain Chips | https://codeforces.com/problemset/problem/1814/E | [
"data structures",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1888
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1814-D | codeforces | 1814-D | Balancing Weapons | https://codeforces.com/problemset/problem/1814/D | [
"binary search",
"brute force",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1084
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1814-C | codeforces | 1814-C | Search in Parallel | https://codeforces.com/problemset/problem/1814/C | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12758
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1814-B | codeforces | 1814-B | Long Legs | https://codeforces.com/problemset/problem/1814/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11960
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1814-A | codeforces | 1814-A | Coins | https://codeforces.com/problemset/problem/1814/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 59438
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1812-J | codeforces | 1812-J | Unmysterious Language | https://codeforces.com/problemset/problem/1812/J | [
"*special",
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 6330
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1812-I | codeforces | 1812-I | Mountain Climber | https://codeforces.com/problemset/problem/1812/I | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 296
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1812-H | codeforces | 1812-H | Expected Twist | https://codeforces.com/problemset/problem/1812/H | [
"*special",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 178
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1812-G | codeforces | 1812-G | Colour Vision | https://codeforces.com/problemset/problem/1812/G | [
"*special",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 633
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1812-F | codeforces | 1812-F | Factorization | https://codeforces.com/problemset/problem/1812/F | [
"*special",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 1342
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1812-E | codeforces | 1812-E | Not a Geometry Problem | https://codeforces.com/problemset/problem/1812/E | [
"*special",
"constructive algorithms",
"geometry",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 4330
} | 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.