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:1514-B | codeforces | 1514-B | AND 0, Sum Big | https://codeforces.com/problemset/problem/1514/B | [
"bitmasks",
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 38193
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1514-A | codeforces | 1514-A | Perfectly Imperfect Array | https://codeforces.com/problemset/problem/1514/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25591
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1513-F | codeforces | 1513-F | Swapping Problem | https://codeforces.com/problemset/problem/1513/F | [
"brute force",
"constructive algorithms",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1504
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1513-E | codeforces | 1513-E | Cost Equilibrium | https://codeforces.com/problemset/problem/1513/E | [
"combinatorics",
"constructive algorithms",
"math",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1807
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1513-D | codeforces | 1513-D | GCD and MST | https://codeforces.com/problemset/problem/1513/D | [
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6980
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1513-C | codeforces | 1513-C | Add One | https://codeforces.com/problemset/problem/1513/C | [
"dp",
"matrices"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 17271
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1513-B | codeforces | 1513-B | AND Sequences | https://codeforces.com/problemset/problem/1513/B | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 21779
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1513-A | codeforces | 1513-A | Array and Peaks | https://codeforces.com/problemset/problem/1513/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20124
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1512-G | codeforces | 1512-G | Short Task | https://codeforces.com/problemset/problem/1512/G | [
"brute force",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9850
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1512-F | codeforces | 1512-F | Education | https://codeforces.com/problemset/problem/1512/F | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6970
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1512-E | codeforces | 1512-E | Permutation by Sum | https://codeforces.com/problemset/problem/1512/E | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11618
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1512-D | codeforces | 1512-D | Corrupted Array | https://codeforces.com/problemset/problem/1512/D | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25230
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1512-C | codeforces | 1512-C | A-B Palindrome | https://codeforces.com/problemset/problem/1512/C | [
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22297
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1512-B | codeforces | 1512-B | Almost Rectangle | https://codeforces.com/problemset/problem/1512/B | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26863
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1512-A | codeforces | 1512-A | Spy Detected! | https://codeforces.com/problemset/problem/1512/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 85333
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1511-G | codeforces | 1511-G | Chips on a Board | https://codeforces.com/problemset/problem/1511/G | [
"bitmasks",
"brute force",
"data structures",
"dp",
"games",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1001
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1511-F | codeforces | 1511-F | Chainword | https://codeforces.com/problemset/problem/1511/F | [
"brute force",
"data structures",
"dp",
"matrices",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 678
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1511-E | codeforces | 1511-E | Colorings and Dominoes | https://codeforces.com/problemset/problem/1511/E | [
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2988
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1511-D | codeforces | 1511-D | Min Cost String | https://codeforces.com/problemset/problem/1511/D | [
"brute force",
"constructive algorithms",
"graphs",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12684
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1511-C | codeforces | 1511-C | Yet Another Card Deck | https://codeforces.com/problemset/problem/1511/C | [
"brute force",
"data structures",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 35887
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1511-B | codeforces | 1511-B | GCD Length | https://codeforces.com/problemset/problem/1511/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25119
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1511-A | codeforces | 1511-A | Review Site | https://codeforces.com/problemset/problem/1511/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29092
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1510-K | codeforces | 1510-K | King's Task | https://codeforces.com/problemset/problem/1510/K | [
"brute force",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6129
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1510-J | codeforces | 1510-J | Japanese Game | https://codeforces.com/problemset/problem/1510/J | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 569
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1510-I | codeforces | 1510-I | Is It Rated? | https://codeforces.com/problemset/problem/1510/I | [
"greedy",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 609
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1510-H | codeforces | 1510-H | Hard Optimization | https://codeforces.com/problemset/problem/1510/H | [
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 141
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1510-G | codeforces | 1510-G | Guide | https://codeforces.com/problemset/problem/1510/G | [] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1396
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1510-F | codeforces | 1510-F | Fiber Shape | https://codeforces.com/problemset/problem/1510/F | [] | null | null | stdin_stdout | 2,800 | {
"solved_count": 66
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1510-E | codeforces | 1510-E | Equilibrium Point /\textbackslash/\textbackslash | https://codeforces.com/problemset/problem/1510/E | [] | null | null | stdin_stdout | 2,700 | {
"solved_count": 273
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1510-D | codeforces | 1510-D | Digits | https://codeforces.com/problemset/problem/1510/D | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2162
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1510-C | codeforces | 1510-C | Cactus Not Enough | https://codeforces.com/problemset/problem/1510/C | [
"dfs and similar",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 264
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1510-B | codeforces | 1510-B | Button Lock | https://codeforces.com/problemset/problem/1510/B | [
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 997
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1510-A | codeforces | 1510-A | ASCII Automata Art | https://codeforces.com/problemset/problem/1510/A | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 172
} | 2026-11-02T05:37:07.883505+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": 16565
} | 2026-11-02T05:37:07.883505+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": 23545
} | 2026-11-02T05:37:07.883505+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": 27632
} | 2026-11-02T05:37:07.883505+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": 195
} | 2026-11-02T05:37:07.883505+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": 494
} | 2026-11-02T05:37:07.883505+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": 772
} | 2026-11-02T05:37:07.883505+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": 1855
} | 2026-11-02T05:37:07.883505+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": 4541
} | 2026-11-02T05:37:07.883505+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": 6801
} | 2026-11-02T05:37:07.883505+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": 4994
} | 2026-11-02T05:37:07.883505+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": 3806
} | 2026-11-02T05:37:07.883505+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": 14501
} | 2026-11-02T05:37:07.883505+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": 26599
} | 2026-11-02T05:37:07.883505+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": 39272
} | 2026-11-02T05:37:07.883505+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": 21371
} | 2026-11-02T05:37:07.883505+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": 33093
} | 2026-11-02T05:37:07.883505+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": 620
} | 2026-11-02T05:37:07.883505+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": 579
} | 2026-11-02T05:37:07.883505+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": 380
} | 2026-11-02T05:37:07.883505+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": 1617
} | 2026-11-02T05:37:07.883505+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": 1940
} | 2026-11-02T05:37:07.883505+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": 901
} | 2026-11-02T05:37:07.883505+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": 6748
} | 2026-11-02T05:37:07.883505+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": 6596
} | 2026-11-02T05:37:07.883505+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": 16370
} | 2026-11-02T05:37:07.883505+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": 28177
} | 2026-11-02T05:37:07.883505+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": 22993
} | 2026-11-02T05:37:07.883505+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": 245
} | 2026-11-02T05:37:07.883505+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": 952
} | 2026-11-02T05:37:07.883505+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": 1333
} | 2026-11-02T05:37:07.883505+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": 3981
} | 2026-11-02T05:37:07.883505+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": 7797
} | 2026-11-02T05:37:07.883505+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": 15123
} | 2026-11-02T05:37:07.883505+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": 21481
} | 2026-11-02T05:37:07.883505+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": 12535
} | 2026-11-02T05:37:07.883505+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": 514
} | 2026-11-02T05:37:07.883505+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": 433
} | 2026-11-02T05:37:07.883505+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": 662
} | 2026-11-02T05:37:07.883505+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": 990
} | 2026-11-02T05:37:07.883505+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": 2412
} | 2026-11-02T05:37:07.883505+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": 9778
} | 2026-11-02T05:37:07.883505+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": 408
} | 2026-11-02T05:37:07.883505+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": 1784
} | 2026-11-02T05:37:07.883505+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": 1755
} | 2026-11-02T05:37:07.883505+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": 7493
} | 2026-11-02T05:37:07.883505+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": 13643
} | 2026-11-02T05:37:07.883505+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": 22305
} | 2026-11-02T05:37:07.883505+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": 22124
} | 2026-11-02T05:37:07.883505+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": 1141
} | 2026-11-02T05:37:07.883505+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": 2200
} | 2026-11-02T05:37:07.883505+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": 2561
} | 2026-11-02T05:37:07.883505+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": 12945
} | 2026-11-02T05:37:07.883505+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": 25701
} | 2026-11-02T05:37:07.883505+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": 25092
} | 2026-11-02T05:37:07.883505+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": 1995
} | 2026-11-02T05:37:07.883505+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": 9282
} | 2026-11-02T05:37:07.883505+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": 1810
} | 2026-11-02T05:37:07.883505+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": 20035
} | 2026-11-02T05:37:07.883505+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": 30052
} | 2026-11-02T05:37:07.883505+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": 30072
} | 2026-11-02T05:37:07.883505+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": 26670
} | 2026-11-02T05:37:07.883505+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": 18510
} | 2026-11-02T05:37:07.883505+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": 22542
} | 2026-11-02T05:37:07.883505+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": 571
} | 2026-11-02T05:37:07.883505+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": 553
} | 2026-11-02T05:37:07.883505+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": 1643
} | 2026-11-02T05:37:07.883505+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": 2958
} | 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.