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: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": 2743
} | 2026-06-01T05:00:40.145500+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": 3828
} | 2026-06-01T05:00:40.145500+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": 8329
} | 2026-06-01T05:00:40.145500+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": 15051
} | 2026-06-01T05:00:40.145500+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": 20411
} | 2026-06-01T05:00:40.145500+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": 9859
} | 2026-06-01T05:00:40.145500+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": 12229
} | 2026-06-01T05:00:40.145500+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": 14830
} | 2026-06-01T05:00:40.145500+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": 364
} | 2026-06-01T05:00:40.145500+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": 464
} | 2026-06-01T05:00:40.145500+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": 1372
} | 2026-06-01T05:00:40.145500+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": 1963
} | 2026-06-01T05:00:40.145500+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": 3679
} | 2026-06-01T05:00:40.145500+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": 17196
} | 2026-06-01T05:00:40.145500+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": 589
} | 2026-06-01T05:00:40.145500+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": 1323
} | 2026-06-01T05:00:40.145500+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": 2451
} | 2026-06-01T05:00:40.145500+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": 5301
} | 2026-06-01T05:00:40.145500+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": 10920
} | 2026-06-01T05:00:40.145500+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": 19367
} | 2026-06-01T05:00:40.145500+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": 50122
} | 2026-06-01T05:00:40.145500+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": 116
} | 2026-06-01T05:00:40.145500+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": 149
} | 2026-06-01T05:00:40.145500+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": 273
} | 2026-06-01T05:00:40.145500+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": 1324
} | 2026-06-01T05:00:40.145500+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": 1435
} | 2026-06-01T05:00:40.145500+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": 6326
} | 2026-06-01T05:00:40.145500+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": 10625
} | 2026-06-01T05:00:40.145500+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": 14800
} | 2026-06-01T05:00:40.145500+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": 16103
} | 2026-06-01T05:00:40.145500+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": 1002
} | 2026-06-01T05:00:40.145500+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": 1919
} | 2026-06-01T05:00:40.145500+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": 1736
} | 2026-06-01T05:00:40.145500+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": 5852
} | 2026-06-01T05:00:40.145500+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": 26368
} | 2026-06-01T05:00:40.145500+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": 22723
} | 2026-06-01T05:00:40.145500+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": 170
} | 2026-06-01T05:00:40.145500+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": 388
} | 2026-06-01T05:00:40.145500+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": 1417
} | 2026-06-01T05:00:40.145500+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": 2048
} | 2026-06-01T05:00:40.145500+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": 9085
} | 2026-06-01T05:00:40.145500+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": 14488
} | 2026-06-01T05:00:40.145500+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": 25100
} | 2026-06-01T05:00:40.145500+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": 24091
} | 2026-06-01T05:00:40.145500+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": 872
} | 2026-06-01T05:00:40.145500+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": 1122
} | 2026-06-01T05:00:40.145500+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": 3447
} | 2026-06-01T05:00:40.145500+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": 11279
} | 2026-06-01T05:00:40.145500+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": 14571
} | 2026-06-01T05:00:40.145500+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": 25796
} | 2026-06-01T05:00:40.145500+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": 1381
} | 2026-06-01T05:00:40.145500+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": 2355
} | 2026-06-01T05:00:40.145500+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": 4746
} | 2026-06-01T05:00:40.145500+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": 12476
} | 2026-06-01T05:00:40.145500+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": 19264
} | 2026-06-01T05:00:40.145500+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": 45094
} | 2026-06-01T05:00:40.145500+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": 102
} | 2026-06-01T05:00:40.145500+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": 508
} | 2026-06-01T05:00:40.145500+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": 11795
} | 2026-06-01T05:00:40.145500+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": 89
} | 2026-06-01T05:00:40.145500+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": 881
} | 2026-06-01T05:00:40.145500+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": 901
} | 2026-06-01T05:00:40.145500+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": 7563
} | 2026-06-01T05:00:40.145500+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": 2386
} | 2026-06-01T05:00:40.145500+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": 4180
} | 2026-06-01T05:00:40.145500+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": 114
} | 2026-06-01T05:00:40.145500+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": 462
} | 2026-06-01T05:00:40.145500+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": 988
} | 2026-06-01T05:00:40.145500+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": 1559
} | 2026-06-01T05:00:40.145500+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": 7981
} | 2026-06-01T05:00:40.145500+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": 876
} | 2026-06-01T05:00:40.145500+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": 3887
} | 2026-06-01T05:00:40.145500+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": 8588
} | 2026-06-01T05:00:40.145500+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": 14396
} | 2026-06-01T05:00:40.145500+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": 21056
} | 2026-06-01T05:00:40.145500+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": 19971
} | 2026-06-01T05:00:40.145500+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": 20431
} | 2026-06-01T05:00:40.145500+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": 158
} | 2026-06-01T05:00:40.145500+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": 609
} | 2026-06-01T05:00:40.145500+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": 869
} | 2026-06-01T05:00:40.145500+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": 1248
} | 2026-06-01T05:00:40.145500+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": 3988
} | 2026-06-01T05:00:40.145500+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": 9286
} | 2026-06-01T05:00:40.145500+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": 13296
} | 2026-06-01T05:00:40.145500+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": 14031
} | 2026-06-01T05:00:40.145500+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": 23563
} | 2026-06-01T05:00:40.145500+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": 107
} | 2026-06-01T05:00:40.145500+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": 1683
} | 2026-06-01T05:00:40.145500+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": 145
} | 2026-06-01T05:00:40.145500+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": 583
} | 2026-06-01T05:00:40.145500+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": 501
} | 2026-06-01T05:00:40.145500+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": 554
} | 2026-06-01T05:00:40.145500+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": 4801
} | 2026-06-01T05:00:40.145500+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": 6106
} | 2026-06-01T05:00:40.145500+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": 646
} | 2026-06-01T05:00:40.145500+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": 45
} | 2026-06-01T05:00:40.145500+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": 978
} | 2026-06-01T05:00:40.145500+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": 1922
} | 2026-06-01T05:00:40.145500+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": 1612
} | 2026-06-01T05:00:40.145500+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": 2825
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.