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:1510-A | codeforces | 1510-A | ASCII Automata Art | https://codeforces.com/problemset/problem/1510/A | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 168
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1509-C | codeforces | 1509-C | The Sports Festival | https://codeforces.com/problemset/problem/1509/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 15935
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1509-B | codeforces | 1509-B | TMT Document | https://codeforces.com/problemset/problem/1509/B | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23331
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1509-A | codeforces | 1509-A | Average Height | https://codeforces.com/problemset/problem/1509/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27406
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1508-F | codeforces | 1508-F | Optimal Encoding | https://codeforces.com/problemset/problem/1508/F | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 181
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1508-E | codeforces | 1508-E | Tree Calendar | https://codeforces.com/problemset/problem/1508/E | [
"brute force",
"constructive algorithms",
"data structures",
"dfs and similar",
"sortings",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 487
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1508-D | codeforces | 1508-D | Swap Pass | https://codeforces.com/problemset/problem/1508/D | [
"constructive algorithms",
"geometry",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 758
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1508-C | codeforces | 1508-C | Complete the MST | https://codeforces.com/problemset/problem/1508/C | [
"bitmasks",
"brute force",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1807
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1508-B | codeforces | 1508-B | Almost Sorted | https://codeforces.com/problemset/problem/1508/B | [
"binary search",
"combinatorics",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4500
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1508-A | codeforces | 1508-A | Binary Literature | https://codeforces.com/problemset/problem/1508/A | [
"constructive algorithms",
"greedy",
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6721
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1506-G | codeforces | 1506-G | Maximize the Remaining String | https://codeforces.com/problemset/problem/1506/G | [
"brute force",
"data structures",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4918
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1506-F | codeforces | 1506-F | Triangular Paths | https://codeforces.com/problemset/problem/1506/F | [
"constructive algorithms",
"graphs",
"math",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3765
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1506-E | codeforces | 1506-E | Restoring the Permutation | https://codeforces.com/problemset/problem/1506/E | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14362
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1506-D | codeforces | 1506-D | Epic Transformation | https://codeforces.com/problemset/problem/1506/D | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 26061
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1506-C | codeforces | 1506-C | Double-ended Strings | https://codeforces.com/problemset/problem/1506/C | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 37782
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1506-B | codeforces | 1506-B | Partial Replacement | https://codeforces.com/problemset/problem/1506/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21279
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1506-A | codeforces | 1506-A | Strange Table | https://codeforces.com/problemset/problem/1506/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32772
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1505-I | codeforces | 1505-I | Mysterious language again, seriously? | https://codeforces.com/problemset/problem/1505/I | [
"*special"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 614
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1505-H | codeforces | 1505-H | L BREAK into program | https://codeforces.com/problemset/problem/1505/H | [
"*special"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 568
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1505-G | codeforces | 1505-G | Encoded message | https://codeforces.com/problemset/problem/1505/G | [
"*special",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 372
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1505-F | codeforces | 1505-F | Math | https://codeforces.com/problemset/problem/1505/F | [
"*special",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1599
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1505-E | codeforces | 1505-E | Cakewalk | https://codeforces.com/problemset/problem/1505/E | [
"*special",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1930
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1505-D | codeforces | 1505-D | Xenolith? Hippodrome? | https://codeforces.com/problemset/problem/1505/D | [
"*special",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 893
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1505-C | codeforces | 1505-C | Fibonacci Words | https://codeforces.com/problemset/problem/1505/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6733
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1505-B | codeforces | 1505-B | DMCA | https://codeforces.com/problemset/problem/1505/B | [
"*special",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6564
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1505-A | codeforces | 1505-A | Is it rated - 2 | https://codeforces.com/problemset/problem/1505/A | [
"*special",
"implementation",
"interactive"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16226
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1504-B | codeforces | 1504-B | Flip the Bits | https://codeforces.com/problemset/problem/1504/B | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 27212
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1504-A | codeforces | 1504-A | Déjà Vu | https://codeforces.com/problemset/problem/1504/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22907
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1503-F | codeforces | 1503-F | Balance the Cards | https://codeforces.com/problemset/problem/1503/F | [
"constructive algorithms",
"data structures",
"divide and conquer",
"geometry",
"graphs",
"implementation"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 239
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1503-E | codeforces | 1503-E | 2-Coloring | https://codeforces.com/problemset/problem/1503/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 917
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1503-D | codeforces | 1503-D | Flip the Cards | https://codeforces.com/problemset/problem/1503/D | [
"2-sat",
"constructive algorithms",
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1317
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1503-C | codeforces | 1503-C | Travelling Salesman Problem | https://codeforces.com/problemset/problem/1503/C | [
"binary search",
"data structures",
"dp",
"greedy",
"shortest paths",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3919
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1503-B | codeforces | 1503-B | 3-Coloring | https://codeforces.com/problemset/problem/1503/B | [
"constructive algorithms",
"games",
"interactive"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7747
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1503-A | codeforces | 1503-A | Balance the Bits | https://codeforces.com/problemset/problem/1503/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14876
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1501-B | codeforces | 1501-B | Napoleon Cake | https://codeforces.com/problemset/problem/1501/B | [
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21351
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1501-A | codeforces | 1501-A | Alexey and Train | https://codeforces.com/problemset/problem/1501/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12363
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1500-F | codeforces | 1500-F | Cupboards Jumps | https://codeforces.com/problemset/problem/1500/F | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 494
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1500-E | codeforces | 1500-E | Subset Trick | https://codeforces.com/problemset/problem/1500/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 432
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1500-D | codeforces | 1500-D | Tiles for Bathroom | https://codeforces.com/problemset/problem/1500/D | [
"data structures",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 648
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1500-C | codeforces | 1500-C | Matrix Sorting | https://codeforces.com/problemset/problem/1500/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 983
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1500-B | codeforces | 1500-B | Two chandeliers | https://codeforces.com/problemset/problem/1500/B | [
"binary search",
"brute force",
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2377
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1500-A | codeforces | 1500-A | Going Home | https://codeforces.com/problemset/problem/1500/A | [
"brute force",
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9648
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1499-G | codeforces | 1499-G | Graph Coloring | https://codeforces.com/problemset/problem/1499/G | [
"data structures",
"graphs",
"interactive"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 400
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1499-F | codeforces | 1499-F | Diameter Cuts | https://codeforces.com/problemset/problem/1499/F | [
"combinatorics",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1694
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1499-E | codeforces | 1499-E | Chaotic Merge | https://codeforces.com/problemset/problem/1499/E | [
"combinatorics",
"dp",
"math",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1698
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1499-D | codeforces | 1499-D | The Number of Pairs | https://codeforces.com/problemset/problem/1499/D | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 7277
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1499-C | codeforces | 1499-C | Minimum Grid Path | https://codeforces.com/problemset/problem/1499/C | [
"brute force",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13517
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1499-B | codeforces | 1499-B | Binary Removals | https://codeforces.com/problemset/problem/1499/B | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22138
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1499-A | codeforces | 1499-A | Domino on Windowsill | https://codeforces.com/problemset/problem/1499/A | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22042
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1498-F | codeforces | 1498-F | Christmas Game | https://codeforces.com/problemset/problem/1498/F | [
"bitmasks",
"data structures",
"dfs and similar",
"dp",
"games",
"math",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1104
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1498-E | codeforces | 1498-E | Two Houses | https://codeforces.com/problemset/problem/1498/E | [
"brute force",
"graphs",
"greedy",
"interactive",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2182
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1498-D | codeforces | 1498-D | Bananas in a Microwave | https://codeforces.com/problemset/problem/1498/D | [
"dfs and similar",
"dp",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2536
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1498-C | codeforces | 1498-C | Planar Reflections | https://codeforces.com/problemset/problem/1498/C | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12576
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1498-B | codeforces | 1498-B | Box Fitting | https://codeforces.com/problemset/problem/1498/B | [
"binary search",
"bitmasks",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 24764
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1498-A | codeforces | 1498-A | GCD Sum | https://codeforces.com/problemset/problem/1498/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24927
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1497-E2 | codeforces | 1497-E2 | Square-Free Division (hard version) | https://codeforces.com/problemset/problem/1497/E2 | [
"data structures",
"dp",
"greedy",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1959
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1497-E1 | codeforces | 1497-E1 | Square-Free Division (easy version) | https://codeforces.com/problemset/problem/1497/E1 | [
"data structures",
"dp",
"greedy",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9192
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1497-D | codeforces | 1497-D | Genius | https://codeforces.com/problemset/problem/1497/D | [
"bitmasks",
"dp",
"graphs",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1792
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1497-C2 | codeforces | 1497-C2 | k-LCM (hard version) | https://codeforces.com/problemset/problem/1497/C2 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 19775
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1497-C1 | codeforces | 1497-C1 | k-LCM (easy version) | https://codeforces.com/problemset/problem/1497/C1 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 29666
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1497-B | codeforces | 1497-B | M-arrays | https://codeforces.com/problemset/problem/1497/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 29006
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1497-A | codeforces | 1497-A | Meximization | https://codeforces.com/problemset/problem/1497/A | [
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26417
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1496-B | codeforces | 1496-B | Max and Mex | https://codeforces.com/problemset/problem/1496/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18406
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1496-A | codeforces | 1496-A | Split it! | https://codeforces.com/problemset/problem/1496/A | [
"brute force",
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22419
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1495-F | codeforces | 1495-F | Squares | https://codeforces.com/problemset/problem/1495/F | [
"constructive algorithms",
"data structures",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 555
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1495-E | codeforces | 1495-E | Qingshan and Daniel | https://codeforces.com/problemset/problem/1495/E | [
"brute force",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 548
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1495-D | codeforces | 1495-D | BFS Trees | https://codeforces.com/problemset/problem/1495/D | [
"combinatorics",
"dfs and similar",
"graphs",
"math",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1597
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1495-C | codeforces | 1495-C | Garden of the Sun | https://codeforces.com/problemset/problem/1495/C | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2938
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1495-B | codeforces | 1495-B | Let's Go Hiking | https://codeforces.com/problemset/problem/1495/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6378
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1495-A | codeforces | 1495-A | Diamond Miner | https://codeforces.com/problemset/problem/1495/A | [
"geometry",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18029
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1494-F | codeforces | 1494-F | Delete The Edges | https://codeforces.com/problemset/problem/1494/F | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 562
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1494-E | codeforces | 1494-E | A-Z Graph | https://codeforces.com/problemset/problem/1494/E | [
"constructive algorithms",
"data structures",
"graphs",
"hashing"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2100
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1494-D | codeforces | 1494-D | Dogeforces | https://codeforces.com/problemset/problem/1494/D | [
"constructive algorithms",
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2864
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1494-C | codeforces | 1494-C | 1D Sokoban | https://codeforces.com/problemset/problem/1494/C | [
"binary search",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5763
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1494-B | codeforces | 1494-B | Berland Crossword | https://codeforces.com/problemset/problem/1494/B | [
"bitmasks",
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15462
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1494-A | codeforces | 1494-A | ABC String | https://codeforces.com/problemset/problem/1494/A | [
"bitmasks",
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23016
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1493-F | codeforces | 1493-F | Enchanted Matrix | https://codeforces.com/problemset/problem/1493/F | [
"bitmasks",
"interactive",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 526
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1493-E | codeforces | 1493-E | Enormous XOR | https://codeforces.com/problemset/problem/1493/E | [
"bitmasks",
"constructive algorithms",
"greedy",
"math",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1121
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1493-D | codeforces | 1493-D | GCD of an Array | https://codeforces.com/problemset/problem/1493/D | [
"brute force",
"data structures",
"hashing",
"implementation",
"math",
"number theory",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5911
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1493-C | codeforces | 1493-C | K-beautiful Strings | https://codeforces.com/problemset/problem/1493/C | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5003
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1493-B | codeforces | 1493-B | Planet Lapituletti | https://codeforces.com/problemset/problem/1493/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12627
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1493-A | codeforces | 1493-A | Anti-knapsack | https://codeforces.com/problemset/problem/1493/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19842
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1492-E | codeforces | 1492-E | Almost Fault-Tolerant Database | https://codeforces.com/problemset/problem/1492/E | [
"brute force",
"constructive algorithms",
"dfs and similar",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1326
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1492-D | codeforces | 1492-D | Genius's Gambit | https://codeforces.com/problemset/problem/1492/D | [
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6556
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1492-C | codeforces | 1492-C | Maximum width | https://codeforces.com/problemset/problem/1492/C | [
"binary search",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17666
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1492-B | codeforces | 1492-B | Card Deck | https://codeforces.com/problemset/problem/1492/B | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21056
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1492-A | codeforces | 1492-A | Three swimmers | https://codeforces.com/problemset/problem/1492/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23485
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1491-I | codeforces | 1491-I | Ruler Of The Zoo | https://codeforces.com/problemset/problem/1491/I | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 109
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1491-H | codeforces | 1491-H | Yuezheng Ling and Dynamic Tree | https://codeforces.com/problemset/problem/1491/H | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 1285
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1491-G | codeforces | 1491-G | Switch and Flip | https://codeforces.com/problemset/problem/1491/G | [
"constructive algorithms",
"graphs",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1055
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1491-F | codeforces | 1491-F | Magnets | https://codeforces.com/problemset/problem/1491/F | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1157
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1491-E | codeforces | 1491-E | Fib-tree | https://codeforces.com/problemset/problem/1491/E | [
"brute force",
"dfs and similar",
"divide and conquer",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2428
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1491-D | codeforces | 1491-D | Zookeeper and The Infinite Zoo | https://codeforces.com/problemset/problem/1491/D | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8515
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1491-C | codeforces | 1491-C | Pekora and Trampoline | https://codeforces.com/problemset/problem/1491/C | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8451
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1491-B | codeforces | 1491-B | Minimal Cost | https://codeforces.com/problemset/problem/1491/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14313
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1491-A | codeforces | 1491-A | K-th Largest Value | https://codeforces.com/problemset/problem/1491/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19118
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1490-G | codeforces | 1490-G | Old Floppy Drive | https://codeforces.com/problemset/problem/1490/G | [
"binary search",
"data structures",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6265
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1490-F | codeforces | 1490-F | Equalize the Array | https://codeforces.com/problemset/problem/1490/F | [
"binary search",
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18684
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1490-E | codeforces | 1490-E | Accidental Victory | https://codeforces.com/problemset/problem/1490/E | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 21275
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1490-D | codeforces | 1490-D | Permutation Transformation | https://codeforces.com/problemset/problem/1490/D | [
"dfs and similar",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22057
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.