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: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": 22867
} | 2026-11-02T05:37:07.883505+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": 176
} | 2026-11-02T05:37:07.883505+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": 468
} | 2026-11-02T05:37:07.883505+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": 1487
} | 2026-11-02T05:37:07.883505+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": 2131
} | 2026-11-02T05:37:07.883505+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": 9247
} | 2026-11-02T05:37:07.883505+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": 15148
} | 2026-11-02T05:37:07.883505+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": 25312
} | 2026-11-02T05:37:07.883505+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": 24189
} | 2026-11-02T05:37:07.883505+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": 996
} | 2026-11-02T05:37:07.883505+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": 1221
} | 2026-11-02T05:37:07.883505+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": 3680
} | 2026-11-02T05:37:07.883505+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": 12058
} | 2026-11-02T05:37:07.883505+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": 14691
} | 2026-11-02T05:37:07.883505+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": 25988
} | 2026-11-02T05:37:07.883505+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": 1559
} | 2026-11-02T05:37:07.883505+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": 2530
} | 2026-11-02T05:37:07.883505+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": 5072
} | 2026-11-02T05:37:07.883505+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": 13457
} | 2026-11-02T05:37:07.883505+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": 19617
} | 2026-11-02T05:37:07.883505+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": 50771
} | 2026-11-02T05:37:07.883505+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": 108
} | 2026-11-02T05:37:07.883505+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": 541
} | 2026-11-02T05:37:07.883505+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": 13258
} | 2026-11-02T05:37:07.883505+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": 222
} | 2026-11-02T05:37:07.883505+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": 948
} | 2026-11-02T05:37:07.883505+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": 950
} | 2026-11-02T05:37:07.883505+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": 7747
} | 2026-11-02T05:37:07.883505+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": 2509
} | 2026-11-02T05:37:07.883505+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": 4321
} | 2026-11-02T05:37:07.883505+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": 138
} | 2026-11-02T05:37:07.883505+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": 658
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1776-C | codeforces | 1776-C | Library game | https://codeforces.com/problemset/problem/1776/C | [
"games",
"greedy",
"interactive",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1022
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1776-B | codeforces | 1776-B | Vittorio Plays with LEGO Bricks | https://codeforces.com/problemset/problem/1776/B | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1615
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1776-A | codeforces | 1776-A | Walking Boy | https://codeforces.com/problemset/problem/1776/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8210
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1775-F | codeforces | 1775-F | Laboratory on Pluto | https://codeforces.com/problemset/problem/1775/F | [
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 930
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1775-E | codeforces | 1775-E | The Human Equation | https://codeforces.com/problemset/problem/1775/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4029
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1775-D | codeforces | 1775-D | Friendly Spiders | https://codeforces.com/problemset/problem/1775/D | [
"dfs and similar",
"graphs",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9408
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1775-C | codeforces | 1775-C | Interesting Sequence | https://codeforces.com/problemset/problem/1775/C | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15459
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1775-B | codeforces | 1775-B | Gardener and the Array | https://codeforces.com/problemset/problem/1775/B | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22951
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1775-A2 | codeforces | 1775-A2 | Gardener and the Capybaras (hard version) | https://codeforces.com/problemset/problem/1775/A2 | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20208
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1775-A1 | codeforces | 1775-A1 | Gardener and the Capybaras (easy version) | https://codeforces.com/problemset/problem/1775/A1 | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20537
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1774-H | codeforces | 1774-H | Maximum Permutation | https://codeforces.com/problemset/problem/1774/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 164
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1774-G | codeforces | 1774-G | Segment Covering | https://codeforces.com/problemset/problem/1774/G | [
"brute force",
"combinatorics",
"constructive algorithms",
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 717
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1774-F2 | codeforces | 1774-F2 | Magician and Pigs (Hard Version) | https://codeforces.com/problemset/problem/1774/F2 | [
"binary search",
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 952
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1774-F1 | codeforces | 1774-F1 | Magician and Pigs (Easy Version) | https://codeforces.com/problemset/problem/1774/F1 | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1319
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1774-E | codeforces | 1774-E | Two Chess Pieces | https://codeforces.com/problemset/problem/1774/E | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4071
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1774-D | codeforces | 1774-D | Same Count One | https://codeforces.com/problemset/problem/1774/D | [
"brute force",
"constructive algorithms",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9597
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1774-C | codeforces | 1774-C | Ice and Fire | https://codeforces.com/problemset/problem/1774/C | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13478
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1774-B | codeforces | 1774-B | Coloring | https://codeforces.com/problemset/problem/1774/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14282
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1774-A | codeforces | 1774-A | Add Plus Minus Sign | https://codeforces.com/problemset/problem/1774/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23844
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-L | codeforces | 1773-L | Lisa's Sequences | https://codeforces.com/problemset/problem/1773/L | [
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 135
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-K | codeforces | 1773-K | King's Puzzle | https://codeforces.com/problemset/problem/1773/K | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1744
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-J | codeforces | 1773-J | Jumbled Trees | https://codeforces.com/problemset/problem/1773/J | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 163
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-I | codeforces | 1773-I | Interactive Factorial Guessing | https://codeforces.com/problemset/problem/1773/I | [
"brute force",
"games",
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 608
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-H | codeforces | 1773-H | Hot and Cold | https://codeforces.com/problemset/problem/1773/H | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 521
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-G | codeforces | 1773-G | Game of Questions | https://codeforces.com/problemset/problem/1773/G | [
"bitmasks",
"combinatorics",
"dp",
"fft",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 578
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-F | codeforces | 1773-F | Football | https://codeforces.com/problemset/problem/1773/F | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 4997
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-E | codeforces | 1773-E | Easy Assembly | https://codeforces.com/problemset/problem/1773/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6234
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-D | codeforces | 1773-D | Dominoes | https://codeforces.com/problemset/problem/1773/D | [
"combinatorics",
"flows",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 666
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-C | codeforces | 1773-C | Cactus Meets Torus | https://codeforces.com/problemset/problem/1773/C | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 87
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-B | codeforces | 1773-B | BinCoin | https://codeforces.com/problemset/problem/1773/B | [
"binary search",
"divide and conquer",
"hashing",
"implementation",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1018
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1773-A | codeforces | 1773-A | Amazing Trick | https://codeforces.com/problemset/problem/1773/A | [
"constructive algorithms",
"graph matchings",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2025
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1772-G | codeforces | 1772-G | Gaining Rating | https://codeforces.com/problemset/problem/1772/G | [
"binary search",
"greedy",
"implementation",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1668
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1772-F | codeforces | 1772-F | Copy of a Copy of a Copy | https://codeforces.com/problemset/problem/1772/F | [
"constructive algorithms",
"dfs and similar",
"graphs",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2937
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1772-E | codeforces | 1772-E | Permutation Game | https://codeforces.com/problemset/problem/1772/E | [
"games"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7852
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1772-D | codeforces | 1772-D | Absolute Sorting | https://codeforces.com/problemset/problem/1772/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19270
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1772-C | codeforces | 1772-C | Different Differences | https://codeforces.com/problemset/problem/1772/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26701
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1772-B | codeforces | 1772-B | Matrix Rotation | https://codeforces.com/problemset/problem/1772/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33703
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1772-A | codeforces | 1772-A | A+B? | https://codeforces.com/problemset/problem/1772/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 63432
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1771-F | codeforces | 1771-F | Hossam and Range Minimum Query | https://codeforces.com/problemset/problem/1771/F | [
"binary search",
"bitmasks",
"data structures",
"hashing",
"probabilities",
"strings",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1809
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1771-E | codeforces | 1771-E | Hossam and a Letter | https://codeforces.com/problemset/problem/1771/E | [
"brute force",
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 864
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1771-D | codeforces | 1771-D | Hossam and (sub-)palindromic tree | https://codeforces.com/problemset/problem/1771/D | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"strings",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3359
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1771-C | codeforces | 1771-C | Hossam and Trainees | https://codeforces.com/problemset/problem/1771/C | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12138
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1771-B | codeforces | 1771-B | Hossam and Friends | https://codeforces.com/problemset/problem/1771/B | [
"binary search",
"constructive algorithms",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 23642
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1771-A | codeforces | 1771-A | Hossam and Combinatorics | https://codeforces.com/problemset/problem/1771/A | [
"combinatorics",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25920
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1770-H | codeforces | 1770-H | Koxia, Mahiru and Winter Festival | https://codeforces.com/problemset/problem/1770/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 179
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1770-G | codeforces | 1770-G | Koxia and Bracket | https://codeforces.com/problemset/problem/1770/G | [
"divide and conquer",
"fft",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 198
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1770-F | codeforces | 1770-F | Koxia and Sequence | https://codeforces.com/problemset/problem/1770/F | [
"bitmasks",
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1118
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1770-E | codeforces | 1770-E | Koxia and Tree | https://codeforces.com/problemset/problem/1770/E | [
"combinatorics",
"dfs and similar",
"dp",
"dsu",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1669
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1770-D | codeforces | 1770-D | Koxia and Game | https://codeforces.com/problemset/problem/1770/D | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dsu",
"flows",
"games",
"graph matchings",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4548
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1770-C | codeforces | 1770-C | Koxia and Number Theory | https://codeforces.com/problemset/problem/1770/C | [
"brute force",
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9877
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1770-B | codeforces | 1770-B | Koxia and Permutation | https://codeforces.com/problemset/problem/1770/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21105
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1770-A | codeforces | 1770-A | Koxia and Whiteboards | https://codeforces.com/problemset/problem/1770/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25620
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1769-D3 | codeforces | 1769-D3 | Игра в Девятку III | https://codeforces.com/problemset/problem/1769/D3 | [
"*special",
"brute force"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 130
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1769-D2 | codeforces | 1769-D2 | Игра в Девятку II | https://codeforces.com/problemset/problem/1769/D2 | [
"*special",
"brute force"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 215
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1769-D1 | codeforces | 1769-D1 | Игра в Девятку I | https://codeforces.com/problemset/problem/1769/D1 | [
"*special",
"brute force",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 427
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1769-C2 | codeforces | 1769-C2 | Подкрутка II | https://codeforces.com/problemset/problem/1769/C2 | [
"*special",
"dp"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 1098
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1769-C1 | codeforces | 1769-C1 | Подкрутка I | https://codeforces.com/problemset/problem/1769/C1 | [
"*special",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 1134
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1769-B2 | codeforces | 1769-B2 | Копирование файлов II | https://codeforces.com/problemset/problem/1769/B2 | [
"*special",
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 964
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1769-B1 | codeforces | 1769-B1 | Копирование файлов I | https://codeforces.com/problemset/problem/1769/B1 | [
"*special",
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 1641
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1769-A | codeforces | 1769-A | Узкая дорога | https://codeforces.com/problemset/problem/1769/A | [
"*special",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 2196
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1768-F | codeforces | 1768-F | Wonderful Jump | https://codeforces.com/problemset/problem/1768/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1497
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1768-E | codeforces | 1768-E | Partial Sorting | https://codeforces.com/problemset/problem/1768/E | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2397
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1768-D | codeforces | 1768-D | Lucky Permutation | https://codeforces.com/problemset/problem/1768/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9552
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1768-C | codeforces | 1768-C | Elemental Decompress | https://codeforces.com/problemset/problem/1768/C | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15954
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1768-B | codeforces | 1768-B | Quick Sort | https://codeforces.com/problemset/problem/1768/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26185
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1768-A | codeforces | 1768-A | Greatest Convex | https://codeforces.com/problemset/problem/1768/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31359
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1767-F | codeforces | 1767-F | Two Subtrees | https://codeforces.com/problemset/problem/1767/F | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 500
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1767-E | codeforces | 1767-E | Algebra Flash | https://codeforces.com/problemset/problem/1767/E | [
"bitmasks",
"brute force",
"dp",
"graphs",
"math",
"meet-in-the-middle",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1357
} | 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.