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:1748-D | codeforces | 1748-D | ConstructOR | https://codeforces.com/problemset/problem/1748/D | [
"bitmasks",
"chinese remainder theorem",
"combinatorics",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3382
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1748-C | codeforces | 1748-C | Zero-Sum Prefixes | https://codeforces.com/problemset/problem/1748/C | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13479
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1748-B | codeforces | 1748-B | Diverse Substrings | https://codeforces.com/problemset/problem/1748/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17120
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1748-A | codeforces | 1748-A | The Ultimate Square | https://codeforces.com/problemset/problem/1748/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25533
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1747-E | codeforces | 1747-E | List Generation | https://codeforces.com/problemset/problem/1747/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 734
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1747-D | codeforces | 1747-D | Yet Another Problem | https://codeforces.com/problemset/problem/1747/D | [
"binary search",
"bitmasks",
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5826
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1747-C | codeforces | 1747-C | Swap Game | https://codeforces.com/problemset/problem/1747/C | [
"games"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 23953
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1747-B | codeforces | 1747-B | BAN BAN | https://codeforces.com/problemset/problem/1747/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26541
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1747-A | codeforces | 1747-A | Two Groups | https://codeforces.com/problemset/problem/1747/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26732
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1746-G | codeforces | 1746-G | Olympiad Training | https://codeforces.com/problemset/problem/1746/G | [
"binary search",
"data structures",
"dp",
"flows",
"geometry",
"implementation",
"sortings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 126
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1746-F | codeforces | 1746-F | Kazaee | https://codeforces.com/problemset/problem/1746/F | [
"data structures",
"hashing",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 2948
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1746-E2 | codeforces | 1746-E2 | Joking (Hard Version) | https://codeforces.com/problemset/problem/1746/E2 | [
"dp",
"interactive"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 630
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1746-E1 | codeforces | 1746-E1 | Joking (Easy Version) | https://codeforces.com/problemset/problem/1746/E1 | [
"binary search",
"constructive algorithms",
"interactive",
"ternary search"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1868
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1746-D | codeforces | 1746-D | Paths on the Tree | https://codeforces.com/problemset/problem/1746/D | [
"dfs and similar",
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5318
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1746-C | codeforces | 1746-C | Permutation Operations | https://codeforces.com/problemset/problem/1746/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14379
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1746-B | codeforces | 1746-B | Rebellion | https://codeforces.com/problemset/problem/1746/B | [
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18931
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1746-A | codeforces | 1746-A | Maxmina | https://codeforces.com/problemset/problem/1746/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21252
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1744-F | codeforces | 1744-F | MEX vs MED | https://codeforces.com/problemset/problem/1744/F | [
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4050
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1744-E2 | codeforces | 1744-E2 | Divisible Numbers (hard version) | https://codeforces.com/problemset/problem/1744/E2 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7160
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1744-E1 | codeforces | 1744-E1 | Divisible Numbers (easy version) | https://codeforces.com/problemset/problem/1744/E1 | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13233
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1744-D | codeforces | 1744-D | Divisibility by 2^n | https://codeforces.com/problemset/problem/1744/D | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25108
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1744-C | codeforces | 1744-C | Traffic Light | https://codeforces.com/problemset/problem/1744/C | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 50243
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1744-B | codeforces | 1744-B | Even-Odd Increments | https://codeforces.com/problemset/problem/1744/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25169
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1744-A | codeforces | 1744-A | Number Replacement | https://codeforces.com/problemset/problem/1744/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29183
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1743-G | codeforces | 1743-G | Antifibonacci Cut | https://codeforces.com/problemset/problem/1743/G | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"data structures",
"dp",
"hashing",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 459
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1743-F | codeforces | 1743-F | Intersection and Union | https://codeforces.com/problemset/problem/1743/F | [
"data structures",
"dp",
"matrices",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1937
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1743-E | codeforces | 1743-E | FTL | https://codeforces.com/problemset/problem/1743/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1964
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1743-D | codeforces | 1743-D | Problem with Random Tests | https://codeforces.com/problemset/problem/1743/D | [
"brute force",
"dp",
"greedy",
"probabilities"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8566
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1743-C | codeforces | 1743-C | Save the Magazines | https://codeforces.com/problemset/problem/1743/C | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20953
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1743-B | codeforces | 1743-B | Permutation Value | https://codeforces.com/problemset/problem/1743/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23375
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1743-A | codeforces | 1743-A | Password | https://codeforces.com/problemset/problem/1743/A | [
"brute force",
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30325
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1742-G | codeforces | 1742-G | Orray | https://codeforces.com/problemset/problem/1742/G | [
"bitmasks",
"brute force",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14083
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1742-F | codeforces | 1742-F | Smaller | https://codeforces.com/problemset/problem/1742/F | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14575
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1742-E | codeforces | 1742-E | Scuza | https://codeforces.com/problemset/problem/1742/E | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 43488
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1742-D | codeforces | 1742-D | Coprime | https://codeforces.com/problemset/problem/1742/D | [
"brute force",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 37721
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1742-C | codeforces | 1742-C | Stripes | https://codeforces.com/problemset/problem/1742/C | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 41570
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1742-B | codeforces | 1742-B | Increasing | https://codeforces.com/problemset/problem/1742/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 64525
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1742-A | codeforces | 1742-A | Sum | https://codeforces.com/problemset/problem/1742/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 114324
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1741-G | codeforces | 1741-G | Kirill and Company | https://codeforces.com/problemset/problem/1741/G | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2019
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1741-F | codeforces | 1741-F | Multi-Colored Segments | https://codeforces.com/problemset/problem/1741/F | [
"binary search",
"data structures",
"math",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3044
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1741-E | codeforces | 1741-E | Sending a Sequence Over the Network | https://codeforces.com/problemset/problem/1741/E | [
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 19459
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1741-D | codeforces | 1741-D | Masha and a Beautiful Tree | https://codeforces.com/problemset/problem/1741/D | [
"dfs and similar",
"divide and conquer",
"graphs",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19161
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1741-C | codeforces | 1741-C | Minimize the Thickness | https://codeforces.com/problemset/problem/1741/C | [
"brute force",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19738
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1741-B | codeforces | 1741-B | Funny Permutation | https://codeforces.com/problemset/problem/1741/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27023
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1741-A | codeforces | 1741-A | Compare T-Shirt Sizes | https://codeforces.com/problemset/problem/1741/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34249
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1740-I | codeforces | 1740-I | Arranging Crystal Balls | https://codeforces.com/problemset/problem/1740/I | [
"data structures",
"divide and conquer",
"dp",
"geometry",
"graphs",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 323
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1740-H | codeforces | 1740-H | MEX Tree Manipulation | https://codeforces.com/problemset/problem/1740/H | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 511
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1740-G | codeforces | 1740-G | Dangerous Laser Power | https://codeforces.com/problemset/problem/1740/G | [
"constructive algorithms",
"dsu",
"sortings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 424
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1740-F | codeforces | 1740-F | Conditional Mix | https://codeforces.com/problemset/problem/1740/F | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1185
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1740-E | codeforces | 1740-E | Hanging Hearts | https://codeforces.com/problemset/problem/1740/E | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5193
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1740-D | codeforces | 1740-D | Knowledge Cards | https://codeforces.com/problemset/problem/1740/D | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9262
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1740-C | codeforces | 1740-C | Bricks and Bags | https://codeforces.com/problemset/problem/1740/C | [
"constructive algorithms",
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12531
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1740-B | codeforces | 1740-B | Jumbo Extra Cheese 2 | https://codeforces.com/problemset/problem/1740/B | [
"geometry",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14431
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1740-A | codeforces | 1740-A | Factorise N+M | https://codeforces.com/problemset/problem/1740/A | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23682
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1739-F | codeforces | 1739-F | Keyboard Design | https://codeforces.com/problemset/problem/1739/F | [
"bitmasks",
"data structures",
"dp",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 697
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1739-E | codeforces | 1739-E | Cleaning Robot | https://codeforces.com/problemset/problem/1739/E | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1550
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1739-D | codeforces | 1739-D | Reset K Edges | https://codeforces.com/problemset/problem/1739/D | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6745
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1739-C | codeforces | 1739-C | Card Game | https://codeforces.com/problemset/problem/1739/C | [
"combinatorics",
"constructive algorithms",
"dp",
"games"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10340
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1739-B | codeforces | 1739-B | Array Recovery | https://codeforces.com/problemset/problem/1739/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24813
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1739-A | codeforces | 1739-A | Immobile Knight | https://codeforces.com/problemset/problem/1739/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24166
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1738-H | codeforces | 1738-H | Palindrome Addicts | https://codeforces.com/problemset/problem/1738/H | [
"data structures",
"strings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 321
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1738-G | codeforces | 1738-G | Anti-Increasing Addicts | https://codeforces.com/problemset/problem/1738/G | [
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 589
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1738-F | codeforces | 1738-F | Connectivity Addicts | https://codeforces.com/problemset/problem/1738/F | [
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"interactive",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1440
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1738-E | codeforces | 1738-E | Balance Addicts | https://codeforces.com/problemset/problem/1738/E | [
"combinatorics",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1888
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1738-D | codeforces | 1738-D | Permutation Addicts | https://codeforces.com/problemset/problem/1738/D | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3805
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1738-C | codeforces | 1738-C | Even Number Addicts | https://codeforces.com/problemset/problem/1738/C | [
"dp",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13224
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1738-B | codeforces | 1738-B | Prefix Sum Addicts | https://codeforces.com/problemset/problem/1738/B | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19483
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1738-A | codeforces | 1738-A | Glory Addicts | https://codeforces.com/problemset/problem/1738/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14274
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1737-G | codeforces | 1737-G | Ela Takes Dancing Class | https://codeforces.com/problemset/problem/1737/G | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 188
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1737-F | codeforces | 1737-F | Ela and Prime GCD | https://codeforces.com/problemset/problem/1737/F | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 167
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1737-E | codeforces | 1737-E | Ela Goes Hiking | https://codeforces.com/problemset/problem/1737/E | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1154
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1737-D | codeforces | 1737-D | Ela and the Wiring Wizard | https://codeforces.com/problemset/problem/1737/D | [
"brute force",
"dp",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2155
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1737-C | codeforces | 1737-C | Ela and Crickets | https://codeforces.com/problemset/problem/1737/C | [
"constructive algorithms",
"games",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6522
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1737-B | codeforces | 1737-B | Ela's Fitness and the Luxury Number | https://codeforces.com/problemset/problem/1737/B | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10320
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1737-A | codeforces | 1737-A | Ela Sorting Books | https://codeforces.com/problemset/problem/1737/A | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11023
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1736-E | codeforces | 1736-E | Swap and Take | https://codeforces.com/problemset/problem/1736/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 954
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1736-D | codeforces | 1736-D | Equal Binary Subsequences | https://codeforces.com/problemset/problem/1736/D | [
"constructive algorithms",
"geometry",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2845
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1736-C2 | codeforces | 1736-C2 | Good Subarrays (Hard Version) | https://codeforces.com/problemset/problem/1736/C2 | [
"binary search",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1527
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1736-C1 | codeforces | 1736-C1 | Good Subarrays (Easy Version) | https://codeforces.com/problemset/problem/1736/C1 | [
"binary search",
"data structures",
"schedules",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16842
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1736-B | codeforces | 1736-B | Playing with GCD | https://codeforces.com/problemset/problem/1736/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20821
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1736-A | codeforces | 1736-A | Make A Equal to B | https://codeforces.com/problemset/problem/1736/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24428
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1735-F | codeforces | 1735-F | Pebbles and Beads | https://codeforces.com/problemset/problem/1735/F | [
"data structures",
"geometry"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 269
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1735-E | codeforces | 1735-E | House Planning | https://codeforces.com/problemset/problem/1735/E | [
"constructive algorithms",
"data structures",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1286
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1735-D | codeforces | 1735-D | Meta-set | https://codeforces.com/problemset/problem/1735/D | [
"brute force",
"combinatorics",
"data structures",
"hashing",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7275
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1735-C | codeforces | 1735-C | Phase Shift | https://codeforces.com/problemset/problem/1735/C | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11129
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1735-B | codeforces | 1735-B | Tea with Tangerines | https://codeforces.com/problemset/problem/1735/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19680
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1735-A | codeforces | 1735-A | Working Week | https://codeforces.com/problemset/problem/1735/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21195
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1734-F | codeforces | 1734-F | Zeros and Ones | https://codeforces.com/problemset/problem/1734/F | [
"bitmasks",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1035
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1734-E | codeforces | 1734-E | Rectangular Congruence | https://codeforces.com/problemset/problem/1734/E | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3353
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1734-D | codeforces | 1734-D | Slime Escape | https://codeforces.com/problemset/problem/1734/D | [
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7231
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1734-C | codeforces | 1734-C | Removing Smallest Multiples | https://codeforces.com/problemset/problem/1734/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 32094
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1734-B | codeforces | 1734-B | Bright, Nice, Brilliant | https://codeforces.com/problemset/problem/1734/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16514
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1734-A | codeforces | 1734-A | Select Three Sticks | https://codeforces.com/problemset/problem/1734/A | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22633
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1733-E | codeforces | 1733-E | Conveyor | https://codeforces.com/problemset/problem/1733/E | [
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1744
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1733-D2 | codeforces | 1733-D2 | Zero-One (Hard Version) | https://codeforces.com/problemset/problem/1733/D2 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4903
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1733-D1 | codeforces | 1733-D1 | Zero-One (Easy Version) | https://codeforces.com/problemset/problem/1733/D1 | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15296
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1733-C | codeforces | 1733-C | Parity Shuffle Sorting | https://codeforces.com/problemset/problem/1733/C | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17345
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1733-B | codeforces | 1733-B | Rule of League | https://codeforces.com/problemset/problem/1733/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21411
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1733-A | codeforces | 1733-A | Consecutive Sum | https://codeforces.com/problemset/problem/1733/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22040
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1732-E | codeforces | 1732-E | Location | https://codeforces.com/problemset/problem/1732/E | [
"data structures",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 617
} | 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.