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: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": 18060
} | 2026-04-13T03:38:27.662191+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": 17150
} | 2026-04-13T03:38:27.662191+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": 3021
} | 2026-04-13T03:38:27.662191+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": 9385
} | 2026-04-13T03:38:27.662191+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": 7580
} | 2026-04-13T03:38:27.662191+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": 12303
} | 2026-04-13T03:38:27.662191+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": 18966
} | 2026-04-13T03:38:27.662191+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": 24732
} | 2026-04-13T03:38:27.662191+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": 26538
} | 2026-04-13T03:38:27.662191+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": 25986
} | 2026-04-13T03:38:27.662191+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": 931
} | 2026-04-13T03:38:27.662191+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": 2695
} | 2026-04-13T03:38:27.662191+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": 5517
} | 2026-04-13T03:38:27.662191+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": 16174
} | 2026-04-13T03:38:27.662191+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": 28051
} | 2026-04-13T03:38:27.662191+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": 21125
} | 2026-04-13T03:38:27.662191+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": 22759
} | 2026-04-13T03:38:27.662191+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": 17604
} | 2026-04-13T03:38:27.662191+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": 174
} | 2026-04-13T03:38:27.662191+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": 379
} | 2026-04-13T03:38:27.662191+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": 837
} | 2026-04-13T03:38:27.662191+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": 1733
} | 2026-04-13T03:38:27.662191+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": 4186
} | 2026-04-13T03:38:27.662191+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": 14550
} | 2026-04-13T03:38:27.662191+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": 17002
} | 2026-04-13T03:38:27.662191+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": 14335
} | 2026-04-13T03:38:27.662191+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": 327
} | 2026-04-13T03:38:27.662191+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": 319
} | 2026-04-13T03:38:27.662191+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": 1030
} | 2026-04-13T03:38:27.662191+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": 1219
} | 2026-04-13T03:38:27.662191+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": 5066
} | 2026-04-13T03:38:27.662191+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": 12726
} | 2026-04-13T03:38:27.662191+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": 16647
} | 2026-04-13T03:38:27.662191+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": 18827
} | 2026-04-13T03:38:27.662191+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": 315
} | 2026-04-13T03:38:27.662191+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": 419
} | 2026-04-13T03:38:27.662191+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": 1481
} | 2026-04-13T03:38:27.662191+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": 2344
} | 2026-04-13T03:38:27.662191+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": 3588
} | 2026-04-13T03:38:27.662191+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": 15921
} | 2026-04-13T03:38:27.662191+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": 914
} | 2026-04-13T03:38:27.662191+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": 1701
} | 2026-04-13T03:38:27.662191+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": 1018
} | 2026-04-13T03:38:27.662191+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": 12434
} | 2026-04-13T03:38:27.662191+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": 11521
} | 2026-04-13T03:38:27.662191+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": 50719
} | 2026-04-13T03:38:27.662191+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": 6286
} | 2026-04-13T03:38:27.662191+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": 289
} | 2026-04-13T03:38:27.662191+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": 171
} | 2026-04-13T03:38:27.662191+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": 619
} | 2026-04-13T03:38:27.662191+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": 1330
} | 2026-04-13T03:38:27.662191+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": 4292
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1812-D | codeforces | 1812-D | Trivial Conjecture | https://codeforces.com/problemset/problem/1812/D | [
"*special",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 4895
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1812-C | codeforces | 1812-C | Digits | https://codeforces.com/problemset/problem/1812/C | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 1367
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1812-B | codeforces | 1812-B | Was it Rated? | https://codeforces.com/problemset/problem/1812/B | [
"*special",
"brute force",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 6050
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1812-A | codeforces | 1812-A | Are You a Robot? | https://codeforces.com/problemset/problem/1812/A | [
"*special",
"expression parsing",
"strings"
] | null | null | stdin_stdout | null | {
"solved_count": 14321
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1811-G2 | codeforces | 1811-G2 | Vlad and the Nice Paths (hard version) | https://codeforces.com/problemset/problem/1811/G2 | [
"binary search",
"combinatorics",
"data structures",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2115
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1811-G1 | codeforces | 1811-G1 | Vlad and the Nice Paths (easy version) | https://codeforces.com/problemset/problem/1811/G1 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2477
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1811-F | codeforces | 1811-F | Is It Flower? | https://codeforces.com/problemset/problem/1811/F | [
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2153
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1811-E | codeforces | 1811-E | Living Sequence | https://codeforces.com/problemset/problem/1811/E | [
"binary search",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14363
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1811-D | codeforces | 1811-D | Umka and a Long Flight | https://codeforces.com/problemset/problem/1811/D | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8613
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1811-C | codeforces | 1811-C | Restore the Array | https://codeforces.com/problemset/problem/1811/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22186
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1811-B | codeforces | 1811-B | Conveyor Belts | https://codeforces.com/problemset/problem/1811/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22293
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1811-A | codeforces | 1811-A | Insert Digit | https://codeforces.com/problemset/problem/1811/A | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34556
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1810-H | codeforces | 1810-H | Last Number | https://codeforces.com/problemset/problem/1810/H | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 170
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1810-G | codeforces | 1810-G | The Maximum Prefix | https://codeforces.com/problemset/problem/1810/G | [
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1205
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1810-F | codeforces | 1810-F | M-tree | https://codeforces.com/problemset/problem/1810/F | [
"data structures",
"math",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 656
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1810-E | codeforces | 1810-E | Monsters | https://codeforces.com/problemset/problem/1810/E | [
"brute force",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3893
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1810-D | codeforces | 1810-D | Climbing the Tree | https://codeforces.com/problemset/problem/1810/D | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8511
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1810-C | codeforces | 1810-C | Make It Permutation | https://codeforces.com/problemset/problem/1810/C | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16506
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1810-B | codeforces | 1810-B | Candies | https://codeforces.com/problemset/problem/1810/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18916
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1810-A | codeforces | 1810-A | Beautiful Sequence | https://codeforces.com/problemset/problem/1810/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21878
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1809-G | codeforces | 1809-G | Prediction | https://codeforces.com/problemset/problem/1809/G | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 549
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1809-F | codeforces | 1809-F | Traveling in Berland | https://codeforces.com/problemset/problem/1809/F | [
"binary search",
"data structures",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 929
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1809-E | codeforces | 1809-E | Two Tanks | https://codeforces.com/problemset/problem/1809/E | [
"binary search",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1063
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1809-D | codeforces | 1809-D | Binary String Sorting | https://codeforces.com/problemset/problem/1809/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7256
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1809-C | codeforces | 1809-C | Sum on Subarrays | https://codeforces.com/problemset/problem/1809/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15123
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1809-B | codeforces | 1809-B | Points on Plane | https://codeforces.com/problemset/problem/1809/B | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22299
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1809-A | codeforces | 1809-A | Garland | https://codeforces.com/problemset/problem/1809/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25131
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1808-E3 | codeforces | 1808-E3 | Minibuses on Venus (hard version) | https://codeforces.com/problemset/problem/1808/E3 | [
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 560
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1808-E2 | codeforces | 1808-E2 | Minibuses on Venus (medium version) | https://codeforces.com/problemset/problem/1808/E2 | [
"combinatorics",
"divide and conquer",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 837
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1808-E1 | codeforces | 1808-E1 | Minibuses on Venus (easy version) | https://codeforces.com/problemset/problem/1808/E1 | [
"combinatorics",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1584
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1808-D | codeforces | 1808-D | Petya, Petya, Petr, and Palindromes | https://codeforces.com/problemset/problem/1808/D | [
"binary search",
"brute force",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2697
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1808-C | codeforces | 1808-C | Unlucky Numbers | https://codeforces.com/problemset/problem/1808/C | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4308
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1808-B | codeforces | 1808-B | Playing in a Casino | https://codeforces.com/problemset/problem/1808/B | [
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 29294
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1808-A | codeforces | 1808-A | Lucky Numbers | https://codeforces.com/problemset/problem/1808/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20559
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1807-G2 | codeforces | 1807-G2 | Subsequence Addition (Hard Version) | https://codeforces.com/problemset/problem/1807/G2 | [
"bitmasks",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27608
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1807-G1 | codeforces | 1807-G1 | Subsequence Addition (Easy Version) | https://codeforces.com/problemset/problem/1807/G1 | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22179
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1807-F | codeforces | 1807-F | Bouncy Ball | https://codeforces.com/problemset/problem/1807/F | [
"brute force",
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7292
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1807-E | codeforces | 1807-E | Interview | https://codeforces.com/problemset/problem/1807/E | [
"binary search",
"implementation",
"interactive"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16537
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1807-D | codeforces | 1807-D | Odd Queries | https://codeforces.com/problemset/problem/1807/D | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 55951
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1807-C | codeforces | 1807-C | Find and Replace | https://codeforces.com/problemset/problem/1807/C | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34237
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1807-B | codeforces | 1807-B | Grab the Candies | https://codeforces.com/problemset/problem/1807/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 49185
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1807-A | codeforces | 1807-A | Plus or Minus | https://codeforces.com/problemset/problem/1807/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 83940
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1806-F2 | codeforces | 1806-F2 | GCD Master (hard version) | https://codeforces.com/problemset/problem/1806/F2 | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 465
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1806-F1 | codeforces | 1806-F1 | GCD Master (easy version) | https://codeforces.com/problemset/problem/1806/F1 | [
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 463
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1806-E | codeforces | 1806-E | Tree Master | https://codeforces.com/problemset/problem/1806/E | [
"brute force",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3423
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1806-D | codeforces | 1806-D | DSU Master | https://codeforces.com/problemset/problem/1806/D | [
"combinatorics",
"dp",
"dsu",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1183
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1806-C | codeforces | 1806-C | Sequence Master | https://codeforces.com/problemset/problem/1806/C | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8623
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:1806-B | codeforces | 1806-B | Mex Master | https://codeforces.com/problemset/problem/1806/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19642
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.