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: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": 14753
} | 2026-06-01T05:00:40.145500+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": 21177
} | 2026-06-01T05:00:40.145500+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": 12308
} | 2026-06-01T05:00:40.145500+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": 435
} | 2026-06-01T05:00:40.145500+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": 384
} | 2026-06-01T05:00:40.145500+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": 598
} | 2026-06-01T05:00:40.145500+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": 917
} | 2026-06-01T05:00:40.145500+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": 2321
} | 2026-06-01T05:00:40.145500+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": 9543
} | 2026-06-01T05:00:40.145500+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": 237
} | 2026-06-01T05:00:40.145500+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": 1605
} | 2026-06-01T05:00:40.145500+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": 1668
} | 2026-06-01T05:00:40.145500+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": 7094
} | 2026-06-01T05:00:40.145500+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": 13459
} | 2026-06-01T05:00:40.145500+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": 22041
} | 2026-06-01T05:00:40.145500+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": 21979
} | 2026-06-01T05:00:40.145500+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": 1062
} | 2026-06-01T05:00:40.145500+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": 2144
} | 2026-06-01T05:00:40.145500+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": 2506
} | 2026-06-01T05:00:40.145500+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": 12248
} | 2026-06-01T05:00:40.145500+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": 23708
} | 2026-06-01T05:00:40.145500+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": 24788
} | 2026-06-01T05:00:40.145500+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": 1920
} | 2026-06-01T05:00:40.145500+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": 9134
} | 2026-06-01T05:00:40.145500+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": 1743
} | 2026-06-01T05:00:40.145500+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": 19562
} | 2026-06-01T05:00:40.145500+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": 29337
} | 2026-06-01T05:00:40.145500+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": 27755
} | 2026-06-01T05:00:40.145500+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": 26188
} | 2026-06-01T05:00:40.145500+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": 18314
} | 2026-06-01T05:00:40.145500+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": 22285
} | 2026-06-01T05:00:40.145500+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": 423
} | 2026-06-01T05:00:40.145500+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": 538
} | 2026-06-01T05:00:40.145500+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": 1541
} | 2026-06-01T05:00:40.145500+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": 2909
} | 2026-06-01T05:00:40.145500+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": 6345
} | 2026-06-01T05:00:40.145500+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": 17921
} | 2026-06-01T05:00:40.145500+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": 497
} | 2026-06-01T05:00:40.145500+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": 2066
} | 2026-06-01T05:00:40.145500+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": 2826
} | 2026-06-01T05:00:40.145500+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": 5742
} | 2026-06-01T05:00:40.145500+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": 15351
} | 2026-06-01T05:00:40.145500+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": 22868
} | 2026-06-01T05:00:40.145500+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": 506
} | 2026-06-01T05:00:40.145500+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": 1091
} | 2026-06-01T05:00:40.145500+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": 5773
} | 2026-06-01T05:00:40.145500+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": 4962
} | 2026-06-01T05:00:40.145500+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": 12583
} | 2026-06-01T05:00:40.145500+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": 19779
} | 2026-06-01T05:00:40.145500+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": 1292
} | 2026-06-01T05:00:40.145500+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": 6522
} | 2026-06-01T05:00:40.145500+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": 17560
} | 2026-06-01T05:00:40.145500+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": 20951
} | 2026-06-01T05:00:40.145500+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": 23403
} | 2026-06-01T05:00:40.145500+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": 108
} | 2026-06-01T05:00:40.145500+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": 1225
} | 2026-06-01T05:00:40.145500+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": 1015
} | 2026-06-01T05:00:40.145500+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": 1133
} | 2026-06-01T05:00:40.145500+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": 2346
} | 2026-06-01T05:00:40.145500+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": 8337
} | 2026-06-01T05:00:40.145500+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": 8409
} | 2026-06-01T05:00:40.145500+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": 14246
} | 2026-06-01T05:00:40.145500+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": 19077
} | 2026-06-01T05:00:40.145500+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": 6203
} | 2026-06-01T05:00:40.145500+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": 18480
} | 2026-06-01T05:00:40.145500+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": 21056
} | 2026-06-01T05:00:40.145500+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": 21805
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1490-C | codeforces | 1490-C | Sum of Cubes | https://codeforces.com/problemset/problem/1490/C | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 39025
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1490-B | codeforces | 1490-B | Balanced Remainders | https://codeforces.com/problemset/problem/1490/B | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27944
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1490-A | codeforces | 1490-A | Dense Array | https://codeforces.com/problemset/problem/1490/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33020
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1488-J | codeforces | 1488-J | Flower Shop | https://codeforces.com/problemset/problem/1488/J | [
"*special",
"data structures",
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 43
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1488-I | codeforces | 1488-I | Demonic Invasion | https://codeforces.com/problemset/problem/1488/I | [
"*special",
"flows"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 47
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1488-H | codeforces | 1488-H | Build From Suffixes | https://codeforces.com/problemset/problem/1488/H | [
"*special",
"combinatorics",
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 71
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1488-G | codeforces | 1488-G | Painting Numbers | https://codeforces.com/problemset/problem/1488/G | [
"*special",
"data structures",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 135
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1488-F | codeforces | 1488-F | Dogecoin | https://codeforces.com/problemset/problem/1488/F | [
"*special",
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 190
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1488-E | codeforces | 1488-E | Palindromic Doubles | https://codeforces.com/problemset/problem/1488/E | [
"*special",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 232
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1488-D | codeforces | 1488-D | Problemsolving Marathon | https://codeforces.com/problemset/problem/1488/D | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 360
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1488-C | codeforces | 1488-C | Two Policemen | https://codeforces.com/problemset/problem/1488/C | [
"*special",
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 481
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1488-B | codeforces | 1488-B | RBS Deletion | https://codeforces.com/problemset/problem/1488/B | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 602
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1488-A | codeforces | 1488-A | From Zero To Y | https://codeforces.com/problemset/problem/1488/A | [
"*special",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 1820
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1487-G | codeforces | 1487-G | String Counting | https://codeforces.com/problemset/problem/1487/G | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 711
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1487-F | codeforces | 1487-F | Ones | https://codeforces.com/problemset/problem/1487/F | [
"dp",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 503
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1487-E | codeforces | 1487-E | Cheap Dinner | https://codeforces.com/problemset/problem/1487/E | [
"brute force",
"data structures",
"graphs",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5145
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1487-D | codeforces | 1487-D | Pythagorean Triples | https://codeforces.com/problemset/problem/1487/D | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20683
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1487-C | codeforces | 1487-C | Minimum Ties | https://codeforces.com/problemset/problem/1487/C | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15436
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1487-B | codeforces | 1487-B | Cat Cycle | https://codeforces.com/problemset/problem/1487/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 29104
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1487-A | codeforces | 1487-A | Arena | https://codeforces.com/problemset/problem/1487/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27578
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1486-F | codeforces | 1486-F | Pairs of Paths | https://codeforces.com/problemset/problem/1486/F | [
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 812
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1486-E | codeforces | 1486-E | Paired Payment | https://codeforces.com/problemset/problem/1486/E | [
"binary search",
"brute force",
"constructive algorithms",
"dp",
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3380
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1486-D | codeforces | 1486-D | Max Median | https://codeforces.com/problemset/problem/1486/D | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 9854
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1486-C2 | codeforces | 1486-C2 | Guessing the Greatest (hard version) | https://codeforces.com/problemset/problem/1486/C2 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 10039
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1486-C1 | codeforces | 1486-C1 | Guessing the Greatest (easy version) | https://codeforces.com/problemset/problem/1486/C1 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14341
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1486-B | codeforces | 1486-B | Eastern Exhibition | https://codeforces.com/problemset/problem/1486/B | [
"binary search",
"geometry",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20718
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1486-A | codeforces | 1486-A | Shifting Stacks | https://codeforces.com/problemset/problem/1486/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27112
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1485-F | codeforces | 1485-F | Copy or Prefix Sum | https://codeforces.com/problemset/problem/1485/F | [
"combinatorics",
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2341
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1485-E | codeforces | 1485-E | Move and Swap | https://codeforces.com/problemset/problem/1485/E | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1534
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1485-D | codeforces | 1485-D | Multiples and Power Differences | https://codeforces.com/problemset/problem/1485/D | [
"constructive algorithms",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5666
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1485-C | codeforces | 1485-C | Floor and Mod | https://codeforces.com/problemset/problem/1485/C | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11081
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1485-B | codeforces | 1485-B | Replace and Keep Sorted | https://codeforces.com/problemset/problem/1485/B | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17953
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1485-A | codeforces | 1485-A | Add and Divide | https://codeforces.com/problemset/problem/1485/A | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 33687
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.