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: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": 24531
} | 2026-08-10T02:20:32.917453+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": 31280
} | 2026-08-10T02:20:32.917453+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": 6152
} | 2026-08-10T02:20:32.917453+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": 36134
} | 2026-08-10T02:20:32.917453+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": 15898
} | 2026-08-10T02:20:32.917453+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": 43718
} | 2026-08-10T02:20:32.917453+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": 52918
} | 2026-08-10T02:20:32.917453+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": 79541
} | 2026-08-10T02:20:32.917453+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": 53612
} | 2026-08-10T02:20:32.917453+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": 83237
} | 2026-08-10T02:20:32.917453+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": 1351
} | 2026-08-10T02:20:32.917453+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": 4190
} | 2026-08-10T02:20:32.917453+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": 17621
} | 2026-08-10T02:20:32.917453+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": 33921
} | 2026-08-10T02:20:32.917453+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": 27193
} | 2026-08-10T02:20:32.917453+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": 29202
} | 2026-08-10T02:20:32.917453+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": 41497
} | 2026-08-10T02:20:32.917453+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": 1027
} | 2026-08-10T02:20:32.917453+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": 1008
} | 2026-08-10T02:20:32.917453+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": 1968
} | 2026-08-10T02:20:32.917453+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": 10084
} | 2026-08-10T02:20:32.917453+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": 17711
} | 2026-08-10T02:20:32.917453+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": 36560
} | 2026-08-10T02:20:32.917453+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": 1231
} | 2026-08-10T02:20:32.917453+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": 3458
} | 2026-08-10T02:20:32.917453+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": 4787
} | 2026-08-10T02:20:32.917453+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": 19674
} | 2026-08-10T02:20:32.917453+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": 22649
} | 2026-08-10T02:20:32.917453+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": 57522
} | 2026-08-10T02:20:32.917453+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": 425
} | 2026-08-10T02:20:32.917453+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": 349
} | 2026-08-10T02:20:32.917453+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": 638
} | 2026-08-10T02:20:32.917453+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": 847
} | 2026-08-10T02:20:32.917453+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": 2792
} | 2026-08-10T02:20:32.917453+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": 3857
} | 2026-08-10T02:20:32.917453+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": 8476
} | 2026-08-10T02:20:32.917453+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": 15193
} | 2026-08-10T02:20:32.917453+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": 20549
} | 2026-08-10T02:20:32.917453+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": 9895
} | 2026-08-10T02:20:32.917453+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": 12259
} | 2026-08-10T02:20:32.917453+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": 14868
} | 2026-08-10T02:20:32.917453+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": 407
} | 2026-08-10T02:20:32.917453+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": 494
} | 2026-08-10T02:20:32.917453+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": 1415
} | 2026-08-10T02:20:32.917453+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": 1999
} | 2026-08-10T02:20:32.917453+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": 3697
} | 2026-08-10T02:20:32.917453+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": 17388
} | 2026-08-10T02:20:32.917453+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": 648
} | 2026-08-10T02:20:32.917453+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": 1445
} | 2026-08-10T02:20:32.917453+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": 2523
} | 2026-08-10T02:20:32.917453+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": 5383
} | 2026-08-10T02:20:32.917453+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": 11062
} | 2026-08-10T02:20:32.917453+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": 19481
} | 2026-08-10T02:20:32.917453+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": 52986
} | 2026-08-10T02:20:32.917453+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": 137
} | 2026-08-10T02:20:32.917453+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": 431
} | 2026-08-10T02:20:32.917453+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": 314
} | 2026-08-10T02:20:32.917453+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": 1371
} | 2026-08-10T02:20:32.917453+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": 1464
} | 2026-08-10T02:20:32.917453+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": 6375
} | 2026-08-10T02:20:32.917453+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": 11024
} | 2026-08-10T02:20:32.917453+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": 15004
} | 2026-08-10T02:20:32.917453+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": 16140
} | 2026-08-10T02:20:32.917453+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": 1054
} | 2026-08-10T02:20:32.917453+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": 1987
} | 2026-08-10T02:20:32.917453+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": 1960
} | 2026-08-10T02:20:32.917453+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": 5927
} | 2026-08-10T02:20:32.917453+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": 27586
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1780-A | codeforces | 1780-A | Hayato and School | https://codeforces.com/problemset/problem/1780/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22792
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1779-H | codeforces | 1779-H | Olympic Team Building | https://codeforces.com/problemset/problem/1779/H | [
"brute force",
"meet-in-the-middle"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 175
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1779-G | codeforces | 1779-G | The Game of the Century | https://codeforces.com/problemset/problem/1779/G | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 454
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1779-F | codeforces | 1779-F | Xorcerer's Stones | https://codeforces.com/problemset/problem/1779/F | [
"bitmasks",
"constructive algorithms",
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1461
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1779-E | codeforces | 1779-E | Anya's Simultaneous Exhibition | https://codeforces.com/problemset/problem/1779/E | [
"constructive algorithms",
"graphs",
"greedy",
"interactive",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2091
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1779-D | codeforces | 1779-D | Boris and His Amazing Haircut | https://codeforces.com/problemset/problem/1779/D | [
"constructive algorithms",
"data structures",
"dp",
"dsu",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9159
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1779-C | codeforces | 1779-C | Least Prefix Sum | https://codeforces.com/problemset/problem/1779/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14766
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1779-B | codeforces | 1779-B | MKnez's ConstructiveForces Task | https://codeforces.com/problemset/problem/1779/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25185
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1779-A | codeforces | 1779-A | Hall of Fame | https://codeforces.com/problemset/problem/1779/A | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24147
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1778-F | codeforces | 1778-F | Maximizing Root | https://codeforces.com/problemset/problem/1778/F | [
"dfs and similar",
"dp",
"graphs",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 966
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1778-E | codeforces | 1778-E | The Tree Has Fallen! | https://codeforces.com/problemset/problem/1778/E | [
"bitmasks",
"dfs and similar",
"math",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1192
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1778-D | codeforces | 1778-D | Flexible String Revisit | https://codeforces.com/problemset/problem/1778/D | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3561
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1778-C | codeforces | 1778-C | Flexible String | https://codeforces.com/problemset/problem/1778/C | [
"bitmasks",
"brute force",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11667
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1778-B | codeforces | 1778-B | The Forbidden Permutation | https://codeforces.com/problemset/problem/1778/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14627
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1778-A | codeforces | 1778-A | Flip Flop Sum | https://codeforces.com/problemset/problem/1778/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25867
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1777-F | codeforces | 1777-F | Comfortably Numb | https://codeforces.com/problemset/problem/1777/F | [
"bitmasks",
"data structures",
"divide and conquer",
"strings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1467
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1777-E | codeforces | 1777-E | Edge Reverse | https://codeforces.com/problemset/problem/1777/E | [
"binary search",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2461
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1777-D | codeforces | 1777-D | Score of a Tree | https://codeforces.com/problemset/problem/1777/D | [
"bitmasks",
"combinatorics",
"dfs and similar",
"dp",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4897
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1777-C | codeforces | 1777-C | Quiz Master | https://codeforces.com/problemset/problem/1777/C | [
"binary search",
"math",
"number theory",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12948
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1777-B | codeforces | 1777-B | Emordnilap | https://codeforces.com/problemset/problem/1777/B | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 19426
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1777-A | codeforces | 1777-A | Everybody Likes Good Arrays! | https://codeforces.com/problemset/problem/1777/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 47965
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-N | codeforces | 1776-N | Count Permutations | https://codeforces.com/problemset/problem/1776/N | [
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 106
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-M | codeforces | 1776-M | Parmigiana With Seafood | https://codeforces.com/problemset/problem/1776/M | [
"binary search",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 515
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-L | codeforces | 1776-L | Controllers | https://codeforces.com/problemset/problem/1776/L | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12561
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-K | codeforces | 1776-K | Uniform Chemistry | https://codeforces.com/problemset/problem/1776/K | [
"dp",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 220
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-J | codeforces | 1776-J | Italian Data Centers | https://codeforces.com/problemset/problem/1776/J | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 924
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-I | codeforces | 1776-I | Spinach Pizza | https://codeforces.com/problemset/problem/1776/I | [
"games",
"geometry",
"greedy",
"interactive"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 930
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-H | codeforces | 1776-H | Beppa and SwerChat | https://codeforces.com/problemset/problem/1776/H | [
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7651
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-G | codeforces | 1776-G | Another Wine Tasting Event | https://codeforces.com/problemset/problem/1776/G | [
"combinatorics",
"constructive algorithms",
"math",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2453
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-F | codeforces | 1776-F | Train Splitting | https://codeforces.com/problemset/problem/1776/F | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4246
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-E | codeforces | 1776-E | Crossing the Railways | https://codeforces.com/problemset/problem/1776/E | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 118
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1776-D | codeforces | 1776-D | Teamwork | https://codeforces.com/problemset/problem/1776/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 633
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.