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:1797-C | codeforces | 1797-C | Li Hua and Chess | https://codeforces.com/problemset/problem/1797/C | [
"constructive algorithms",
"greedy",
"interactive"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9197
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1797-B | codeforces | 1797-B | Li Hua and Pattern | https://codeforces.com/problemset/problem/1797/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 27568
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1797-A | codeforces | 1797-A | Li Hua and Maze | https://codeforces.com/problemset/problem/1797/A | [
"constructive algorithms",
"flows",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19949
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1796-F | codeforces | 1796-F | Strange Triples | https://codeforces.com/problemset/problem/1796/F | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 268
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1796-E | codeforces | 1796-E | Colored Subgraphs | https://codeforces.com/problemset/problem/1796/E | [
"dfs and similar",
"dp",
"games",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1093
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1796-D | codeforces | 1796-D | Maximum Subarray | https://codeforces.com/problemset/problem/1796/D | [
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5674
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1796-C | codeforces | 1796-C | Maximum Set | https://codeforces.com/problemset/problem/1796/C | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12550
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1796-B | codeforces | 1796-B | Asterisk-Minor Template | https://codeforces.com/problemset/problem/1796/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18637
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1796-A | codeforces | 1796-A | Typical Interview Problem | https://codeforces.com/problemset/problem/1796/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19827
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1795-G | codeforces | 1795-G | Removal Sequences | https://codeforces.com/problemset/problem/1795/G | [
"bitmasks",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 871
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1795-F | codeforces | 1795-F | Blocking Chips | https://codeforces.com/problemset/problem/1795/F | [
"binary search",
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1445
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1795-E | codeforces | 1795-E | Explosions? | https://codeforces.com/problemset/problem/1795/E | [
"binary search",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2484
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1795-D | codeforces | 1795-D | Triangle Coloring | https://codeforces.com/problemset/problem/1795/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14365
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1795-C | codeforces | 1795-C | Tea Tasting | https://codeforces.com/problemset/problem/1795/C | [
"binary search",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19898
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1795-B | codeforces | 1795-B | Ideal Point | https://codeforces.com/problemset/problem/1795/B | [
"brute force",
"geometry",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24595
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1795-A | codeforces | 1795-A | Two Towers | https://codeforces.com/problemset/problem/1795/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24881
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1794-E | codeforces | 1794-E | Labeling the Tree with Distances | https://codeforces.com/problemset/problem/1794/E | [
"data structures",
"dp",
"greedy",
"hashing",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1628
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1794-D | codeforces | 1794-D | Counting Factorizations | https://codeforces.com/problemset/problem/1794/D | [
"combinatorics",
"divide and conquer",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4770
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1794-C | codeforces | 1794-C | Scoring Subsequences | https://codeforces.com/problemset/problem/1794/C | [
"binary search",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 24583
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1794-B | codeforces | 1794-B | Not Dividing | https://codeforces.com/problemset/problem/1794/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 45937
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1794-A | codeforces | 1794-A | Prefix and Suffix Array | https://codeforces.com/problemset/problem/1794/A | [
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19212
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1793-F | codeforces | 1793-F | Rebrending | https://codeforces.com/problemset/problem/1793/F | [
"brute force",
"data structures",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1707
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1793-E | codeforces | 1793-E | Velepin and Marketing | https://codeforces.com/problemset/problem/1793/E | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1395
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1793-D | codeforces | 1793-D | Moscow Gorillas | https://codeforces.com/problemset/problem/1793/D | [
"binary search",
"dp",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7313
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1793-C | codeforces | 1793-C | Dora and Search | https://codeforces.com/problemset/problem/1793/C | [
"constructive algorithms",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 37378
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1793-B | codeforces | 1793-B | Fedya and Array | https://codeforces.com/problemset/problem/1793/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17382
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1793-A | codeforces | 1793-A | Yet Another Promotion | https://codeforces.com/problemset/problem/1793/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18949
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1792-F2 | codeforces | 1792-F2 | Graph Coloring (hard version) | https://codeforces.com/problemset/problem/1792/F2 | [
"brute force",
"combinatorics",
"divide and conquer",
"dp",
"fft",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 580
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1792-F1 | codeforces | 1792-F1 | Graph Coloring (easy version) | https://codeforces.com/problemset/problem/1792/F1 | [
"combinatorics",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1065
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1792-E | codeforces | 1792-E | Divisors and Table | https://codeforces.com/problemset/problem/1792/E | [
"brute force",
"dfs and similar",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1652
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1792-D | codeforces | 1792-D | Fixed Prefix Permutations | https://codeforces.com/problemset/problem/1792/D | [
"binary search",
"bitmasks",
"data structures",
"hashing",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8574
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1792-C | codeforces | 1792-C | Min Max Sort | https://codeforces.com/problemset/problem/1792/C | [
"binary search",
"brute force",
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17345
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1792-B | codeforces | 1792-B | Stand-up Comedian | https://codeforces.com/problemset/problem/1792/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24739
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1792-A | codeforces | 1792-A | GamingForces | https://codeforces.com/problemset/problem/1792/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31707
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1791-G2 | codeforces | 1791-G2 | Teleporters (Hard Version) | https://codeforces.com/problemset/problem/1791/G2 | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6319
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1791-G1 | codeforces | 1791-G1 | Teleporters (Easy Version) | https://codeforces.com/problemset/problem/1791/G1 | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 37591
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1791-F | codeforces | 1791-F | Range Update Point Query | https://codeforces.com/problemset/problem/1791/F | [
"binary search",
"brute force",
"data structures"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16297
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1791-E | codeforces | 1791-E | Negatives and Positives | https://codeforces.com/problemset/problem/1791/E | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 45442
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1791-D | codeforces | 1791-D | Distinct Split | https://codeforces.com/problemset/problem/1791/D | [
"brute force",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 55821
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1791-C | codeforces | 1791-C | Prepend and Append | https://codeforces.com/problemset/problem/1791/C | [
"implementation",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 84181
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1791-B | codeforces | 1791-B | Following Directions | https://codeforces.com/problemset/problem/1791/B | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 54382
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1791-A | codeforces | 1791-A | Codeforces Checking | https://codeforces.com/problemset/problem/1791/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 86211
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1790-G | codeforces | 1790-G | Tokens on Graph | https://codeforces.com/problemset/problem/1790/G | [
"constructive algorithms",
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1366
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1790-F | codeforces | 1790-F | Timofey and Black-White Tree | https://codeforces.com/problemset/problem/1790/F | [
"brute force",
"dfs and similar",
"divide and conquer",
"graphs",
"greedy",
"math",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4272
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1790-E | codeforces | 1790-E | Vlad and a Pair of Numbers | https://codeforces.com/problemset/problem/1790/E | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17844
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1790-D | codeforces | 1790-D | Matryoshkas | https://codeforces.com/problemset/problem/1790/D | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 35500
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1790-C | codeforces | 1790-C | Premutation | https://codeforces.com/problemset/problem/1790/C | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27398
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1790-B | codeforces | 1790-B | Taisia and Dice | https://codeforces.com/problemset/problem/1790/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29355
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1790-A | codeforces | 1790-A | Polycarp and the Day of Pi | https://codeforces.com/problemset/problem/1790/A | [
"implementation",
"math",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 41821
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1789-F | codeforces | 1789-F | Serval and Brain Power | https://codeforces.com/problemset/problem/1789/F | [
"bitmasks",
"brute force",
"dp",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1050
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1789-E | codeforces | 1789-E | Serval and Music Game | https://codeforces.com/problemset/problem/1789/E | [
"brute force",
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1017
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1789-D | codeforces | 1789-D | Serval and Shift-Shift-Shift | https://codeforces.com/problemset/problem/1789/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1982
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1789-C | codeforces | 1789-C | Serval and Toxel's Arrays | https://codeforces.com/problemset/problem/1789/C | [
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10165
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1789-B | codeforces | 1789-B | Serval and Inversion Magic | https://codeforces.com/problemset/problem/1789/B | [
"brute force",
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17798
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1789-A | codeforces | 1789-A | Serval and Mocha's Array | https://codeforces.com/problemset/problem/1789/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38732
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1788-F | codeforces | 1788-F | XOR, Tree, and Queries | https://codeforces.com/problemset/problem/1788/F | [
"bitmasks",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1276
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1788-E | codeforces | 1788-E | Sum Over Zero | https://codeforces.com/problemset/problem/1788/E | [
"data structures",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3574
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1788-D | codeforces | 1788-D | Moving Dots | https://codeforces.com/problemset/problem/1788/D | [
"binary search",
"brute force",
"combinatorics",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4884
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1788-C | codeforces | 1788-C | Matching Numbers | https://codeforces.com/problemset/problem/1788/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19829
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1788-B | codeforces | 1788-B | Sum of Two Numbers | https://codeforces.com/problemset/problem/1788/B | [
"constructive algorithms",
"greedy",
"implementation",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22944
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1788-A | codeforces | 1788-A | One and Two | https://codeforces.com/problemset/problem/1788/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 60982
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1787-I | codeforces | 1787-I | Treasure Hunt | https://codeforces.com/problemset/problem/1787/I | [
"data structures",
"divide and conquer",
"two pointers"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 469
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1787-H | codeforces | 1787-H | Codeforces Scoreboard | https://codeforces.com/problemset/problem/1787/H | [
"binary search",
"data structures",
"dp",
"geometry"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 359
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1787-G | codeforces | 1787-G | Colorful Tree Again | https://codeforces.com/problemset/problem/1787/G | [
"brute force",
"data structures",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 654
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1787-F | codeforces | 1787-F | Inverse Transformation | https://codeforces.com/problemset/problem/1787/F | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 859
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1787-E | codeforces | 1787-E | The Harmonization of XOR | https://codeforces.com/problemset/problem/1787/E | [
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2836
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1787-D | codeforces | 1787-D | Game on Axis | https://codeforces.com/problemset/problem/1787/D | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3899
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1787-C | codeforces | 1787-C | Remove the Bracket | https://codeforces.com/problemset/problem/1787/C | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8560
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1787-B | codeforces | 1787-B | Number Factorization | https://codeforces.com/problemset/problem/1787/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15298
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1787-A | codeforces | 1787-A | Exponential Equation | https://codeforces.com/problemset/problem/1787/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20708
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1786-B | codeforces | 1786-B | Cake Assembly Line | https://codeforces.com/problemset/problem/1786/B | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9940
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1786-A2 | codeforces | 1786-A2 | Alternating Deck (hard version) | https://codeforces.com/problemset/problem/1786/A2 | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12282
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1786-A1 | codeforces | 1786-A1 | Non-alternating Deck (easy version) | https://codeforces.com/problemset/problem/1786/A1 | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14894
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1784-F | codeforces | 1784-F | Minimums or Medians | https://codeforces.com/problemset/problem/1784/F | [] | null | null | stdin_stdout | 3,400 | {
"solved_count": 411
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1784-E | codeforces | 1784-E | Infinite Game | https://codeforces.com/problemset/problem/1784/E | [
"brute force",
"combinatorics",
"dp",
"games",
"probabilities"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 541
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1784-D | codeforces | 1784-D | Wooden Spoon | https://codeforces.com/problemset/problem/1784/D | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1447
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1784-C | codeforces | 1784-C | Monsters (hard version) | https://codeforces.com/problemset/problem/1784/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2028
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1784-B | codeforces | 1784-B | Letter Exchange | https://codeforces.com/problemset/problem/1784/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3722
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1784-A | codeforces | 1784-A | Monsters (easy version) | https://codeforces.com/problemset/problem/1784/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17495
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1783-G | codeforces | 1783-G | Weighed Tree Radius | https://codeforces.com/problemset/problem/1783/G | [
"data structures",
"divide and conquer",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 657
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1783-F | codeforces | 1783-F | Double Sort II | https://codeforces.com/problemset/problem/1783/F | [
"dfs and similar",
"flows",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1506
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1783-E | codeforces | 1783-E | Game of the Year | https://codeforces.com/problemset/problem/1783/E | [
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2579
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1783-D | codeforces | 1783-D | Different Arrays | https://codeforces.com/problemset/problem/1783/D | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5473
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1783-C | codeforces | 1783-C | Yet Another Tournament | https://codeforces.com/problemset/problem/1783/C | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11210
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1783-B | codeforces | 1783-B | Matrix of Differences | https://codeforces.com/problemset/problem/1783/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19598
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1783-A | codeforces | 1783-A | Make it Beautiful | https://codeforces.com/problemset/problem/1783/A | [
"constructive algorithms",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55927
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1781-H2 | codeforces | 1781-H2 | Window Signals (hard version) | https://codeforces.com/problemset/problem/1781/H2 | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 140
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1781-H1 | codeforces | 1781-H1 | Window Signals (easy version) | https://codeforces.com/problemset/problem/1781/H1 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 440
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1781-G | codeforces | 1781-G | Diverse Coloring | https://codeforces.com/problemset/problem/1781/G | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 324
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1781-F | codeforces | 1781-F | Bracket Insertion | https://codeforces.com/problemset/problem/1781/F | [
"combinatorics",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1413
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1781-E | codeforces | 1781-E | Rectangle Shrinking | https://codeforces.com/problemset/problem/1781/E | [
"binary search",
"brute force",
"data structures",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1491
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1781-D | codeforces | 1781-D | Many Perfect Squares | https://codeforces.com/problemset/problem/1781/D | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6440
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1781-C | codeforces | 1781-C | Equal Frequencies | https://codeforces.com/problemset/problem/1781/C | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11442
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1781-B | codeforces | 1781-B | Going to the Cinema | https://codeforces.com/problemset/problem/1781/B | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15125
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1781-A | codeforces | 1781-A | Parallel Projection | https://codeforces.com/problemset/problem/1781/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16185
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1780-G | codeforces | 1780-G | Delicious Dessert | https://codeforces.com/problemset/problem/1780/G | [
"binary search",
"dsu",
"hashing",
"math",
"number theory",
"string suffix structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1113
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1780-F | codeforces | 1780-F | Three Chairs | https://codeforces.com/problemset/problem/1780/F | [
"bitmasks",
"brute force",
"combinatorics",
"data structures",
"dp",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2027
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1780-E | codeforces | 1780-E | Josuke and Complete Graph | https://codeforces.com/problemset/problem/1780/E | [
"binary search",
"brute force",
"data structures",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2004
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1780-D | codeforces | 1780-D | Bit Guessing Game | https://codeforces.com/problemset/problem/1780/D | [
"binary search",
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5998
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1780-B | codeforces | 1780-B | GCD Partition | https://codeforces.com/problemset/problem/1780/B | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 28635
} | 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.