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:2140-F | codeforces | 2140-F | Sum Minimisation | https://codeforces.com/problemset/problem/2140/F | [
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 319
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2140-E2 | codeforces | 2140-E2 | Prime Gaming (Hard Version) | https://codeforces.com/problemset/problem/2140/E2 | [
"bitmasks",
"combinatorics",
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1251
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2140-E1 | codeforces | 2140-E1 | Prime Gaming (Easy Version) | https://codeforces.com/problemset/problem/2140/E1 | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2136
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2140-D | codeforces | 2140-D | A Cruel Segment's Thesis | https://codeforces.com/problemset/problem/2140/D | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4984
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2140-C | codeforces | 2140-C | Ultimate Value | https://codeforces.com/problemset/problem/2140/C | [
"data structures",
"games",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12578
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2140-B | codeforces | 2140-B | Another Divisibility Problem | https://codeforces.com/problemset/problem/2140/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2140-A | codeforces | 2140-A | Shift Sort | https://codeforces.com/problemset/problem/2140/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22470
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2139-B | codeforces | 2139-B | Cake Collection | https://codeforces.com/problemset/problem/2139/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21011
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2139-A | codeforces | 2139-A | Maple and Multiplication | https://codeforces.com/problemset/problem/2139/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26051
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2138-F | codeforces | 2138-F | Ode to the Bridge Builder | https://codeforces.com/problemset/problem/2138/F | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 83
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2138-E2 | codeforces | 2138-E2 | Determinant Construction (Hard Version) | https://codeforces.com/problemset/problem/2138/E2 | [
"brute force",
"constructive algorithms",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 187
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2138-E1 | codeforces | 2138-E1 | Determinant Construction (Easy Version) | https://codeforces.com/problemset/problem/2138/E1 | [
"brute force",
"constructive algorithms",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 244
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2138-D | codeforces | 2138-D | Antiamuny and Slider Movement | https://codeforces.com/problemset/problem/2138/D | [
"brute force",
"combinatorics",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 648
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2138-C2 | codeforces | 2138-C2 | Maple and Tree Beauty (Hard Version) | https://codeforces.com/problemset/problem/2138/C2 | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"fft",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3418
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2138-C1 | codeforces | 2138-C1 | Maple and Tree Beauty (Easy Version) | https://codeforces.com/problemset/problem/2138/C1 | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5499
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2138-B | codeforces | 2138-B | Antiamuny Wants to Learn Swap | https://codeforces.com/problemset/problem/2138/B | [
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5411
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2138-A | codeforces | 2138-A | Cake Assignment | https://codeforces.com/problemset/problem/2138/A | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17200
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2137-G | codeforces | 2137-G | Cry Me a River | https://codeforces.com/problemset/problem/2137/G | [
"dfs and similar",
"dp",
"games",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1948
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2137-F | codeforces | 2137-F | Prefix Maximum Invariance | https://codeforces.com/problemset/problem/2137/F | [
"binary search",
"combinatorics",
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4099
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2137-E | codeforces | 2137-E | Mexification | https://codeforces.com/problemset/problem/2137/E | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10302
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2137-D | codeforces | 2137-D | Replace with Occurrences | https://codeforces.com/problemset/problem/2137/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19779
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2137-C | codeforces | 2137-C | Maximum Even Sum | https://codeforces.com/problemset/problem/2137/C | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23150
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2137-B | codeforces | 2137-B | Fun Permutation | https://codeforces.com/problemset/problem/2137/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26708
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2137-A | codeforces | 2137-A | Collatz Conjecture | https://codeforces.com/problemset/problem/2137/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35547
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2136-B | codeforces | 2136-B | Like the Bitset | https://codeforces.com/problemset/problem/2136/B | [
"constructive algorithms",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21180
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2136-A | codeforces | 2136-A | In the Dream | https://codeforces.com/problemset/problem/2136/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26343
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2135-F | codeforces | 2135-F | To the Infinity | https://codeforces.com/problemset/problem/2135/F | [
"data structures",
"hashing",
"math",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 258
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2135-E2 | codeforces | 2135-E2 | Beyond the Palindrome (Hard Version) | https://codeforces.com/problemset/problem/2135/E2 | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 169
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2135-E1 | codeforces | 2135-E1 | Beyond the Palindrome (Easy Version) | https://codeforces.com/problemset/problem/2135/E1 | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 373
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2135-D2 | codeforces | 2135-D2 | From the Unknown (Hard Version) | https://codeforces.com/problemset/problem/2135/D2 | [
"brute force",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1008
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2135-D1 | codeforces | 2135-D1 | From the Unknown (Easy Version) | https://codeforces.com/problemset/problem/2135/D1 | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2639
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2135-C | codeforces | 2135-C | By the Assignment | https://codeforces.com/problemset/problem/2135/C | [
"binary search",
"bitmasks",
"combinatorics",
"dfs and similar",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4296
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2135-B | codeforces | 2135-B | For the Champion | https://codeforces.com/problemset/problem/2135/B | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7632
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2135-A | codeforces | 2135-A | Against the Difference | https://codeforces.com/problemset/problem/2135/A | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18827
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2134-F | codeforces | 2134-F | Permutation Oddness | https://codeforces.com/problemset/problem/2134/F | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 664
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2134-E | codeforces | 2134-E | Power Boxes | https://codeforces.com/problemset/problem/2134/E | [
"constructive algorithms",
"dp",
"implementation",
"interactive"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2433
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2134-D | codeforces | 2134-D | Sliding Tree | https://codeforces.com/problemset/problem/2134/D | [
"constructive algorithms",
"dfs and similar",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3684
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2134-C | codeforces | 2134-C | Even Larger | https://codeforces.com/problemset/problem/2134/C | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18921
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2134-B | codeforces | 2134-B | Add 0 or K | https://codeforces.com/problemset/problem/2134/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 21202
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2134-A | codeforces | 2134-A | Painting With Two Colors | https://codeforces.com/problemset/problem/2134/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26810
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2133-F | codeforces | 2133-F | Flint and Steel | https://codeforces.com/problemset/problem/2133/F | [
"data structures",
"dp",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 468
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2133-E | codeforces | 2133-E | I Yearned For The Mines | https://codeforces.com/problemset/problem/2133/E | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1719
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2133-D | codeforces | 2133-D | Chicken Jockey | https://codeforces.com/problemset/problem/2133/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7588
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2133-C | codeforces | 2133-C | The Nether | https://codeforces.com/problemset/problem/2133/C | [
"graphs",
"interactive"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12985
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2133-B | codeforces | 2133-B | Villagers | https://codeforces.com/problemset/problem/2133/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25747
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2133-A | codeforces | 2133-A | Redstone? | https://codeforces.com/problemset/problem/2133/A | [
"brute force",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31231
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2132-G | codeforces | 2132-G | Famous Choreographer | https://codeforces.com/problemset/problem/2132/G | [
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 517
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2132-F | codeforces | 2132-F | Rada and the Chamomile Valley | https://codeforces.com/problemset/problem/2132/F | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2810
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2132-E | codeforces | 2132-E | Arithmetics Competition | https://codeforces.com/problemset/problem/2132/E | [
"binary search",
"data structures",
"greedy",
"sortings",
"ternary search"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7708
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2132-D | codeforces | 2132-D | From 1 to Infinity | https://codeforces.com/problemset/problem/2132/D | [
"binary search",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8939
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2132-C2 | codeforces | 2132-C2 | The Cunning Seller (hard version) | https://codeforces.com/problemset/problem/2132/C2 | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13477
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2132-C1 | codeforces | 2132-C1 | The Cunning Seller (easy version) | https://codeforces.com/problemset/problem/2132/C1 | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27992
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2132-B | codeforces | 2132-B | The Secret Number | https://codeforces.com/problemset/problem/2132/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 33839
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2132-A | codeforces | 2132-A | Homework | https://codeforces.com/problemset/problem/2132/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43778
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2131-H | codeforces | 2131-H | Sea, You & copriMe | https://codeforces.com/problemset/problem/2131/H | [
"brute force",
"constructive algorithms",
"graphs",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 893
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2131-G | codeforces | 2131-G | Wafu! | https://codeforces.com/problemset/problem/2131/G | [
"bitmasks",
"brute force",
"data structures",
"dfs and similar",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3821
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2131-F | codeforces | 2131-F | Unjust Binary Life | https://codeforces.com/problemset/problem/2131/F | [
"binary search",
"data structures",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4761
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2131-E | codeforces | 2131-E | Adjacent XOR | https://codeforces.com/problemset/problem/2131/E | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17331
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2131-D | codeforces | 2131-D | Arboris Contractio | https://codeforces.com/problemset/problem/2131/D | [
"data structures",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14487
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2131-C | codeforces | 2131-C | Make it Equal | https://codeforces.com/problemset/problem/2131/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21860
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2131-B | codeforces | 2131-B | Alternating Series | https://codeforces.com/problemset/problem/2131/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31147
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2131-A | codeforces | 2131-A | Lever | https://codeforces.com/problemset/problem/2131/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39150
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2130-B | codeforces | 2130-B | Pathless | https://codeforces.com/problemset/problem/2130/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21653
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2130-A | codeforces | 2130-A | Submission is All You Need | https://codeforces.com/problemset/problem/2130/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28784
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2129-F2 | codeforces | 2129-F2 | Top-K Tracker (Hard Version) | https://codeforces.com/problemset/problem/2129/F2 | [
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 101
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2129-F1 | codeforces | 2129-F1 | Top-K Tracker (Easy Version) | https://codeforces.com/problemset/problem/2129/F1 | [
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 214
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2129-E | codeforces | 2129-E | Induced Subgraph Queries | https://codeforces.com/problemset/problem/2129/E | [
"data structures",
"graphs",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 483
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2129-D | codeforces | 2129-D | Permutation Blackhole | https://codeforces.com/problemset/problem/2129/D | [
"brute force",
"combinatorics",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1210
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2129-C3 | codeforces | 2129-C3 | Interactive RBS (Hard Version) | https://codeforces.com/problemset/problem/2129/C3 | [
"binary search",
"bitmasks",
"constructive algorithms",
"dp",
"interactive"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1707
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2129-C2 | codeforces | 2129-C2 | Interactive RBS (Medium Version) | https://codeforces.com/problemset/problem/2129/C2 | [
"binary search",
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2577
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2129-C1 | codeforces | 2129-C1 | Interactive RBS (Easy Version) | https://codeforces.com/problemset/problem/2129/C1 | [
"binary search",
"bitmasks",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3959
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2129-B | codeforces | 2129-B | Stay or Mirror | https://codeforces.com/problemset/problem/2129/B | [
"brute force",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13697
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2129-A | codeforces | 2129-A | Double Perspective | https://codeforces.com/problemset/problem/2129/A | [
"constructive algorithms",
"dp",
"dsu",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17104
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2128-F | codeforces | 2128-F | Strict Triangle | https://codeforces.com/problemset/problem/2128/F | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 387
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2128-E2 | codeforces | 2128-E2 | Submedians (Hard Version) | https://codeforces.com/problemset/problem/2128/E2 | [
"binary search",
"constructive algorithms",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 804
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2128-E1 | codeforces | 2128-E1 | Submedians (Easy Version) | https://codeforces.com/problemset/problem/2128/E1 | [
"binary search",
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6654
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2128-D | codeforces | 2128-D | Sum of LDS | https://codeforces.com/problemset/problem/2128/D | [
"brute force",
"combinatorics",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12511
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2128-C | codeforces | 2128-C | Leftmost Below | https://codeforces.com/problemset/problem/2128/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20893
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2128-B | codeforces | 2128-B | Deque Process | https://codeforces.com/problemset/problem/2128/B | [
"constructive algorithms",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2128-A | codeforces | 2128-A | Recycling Center | https://codeforces.com/problemset/problem/2128/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28717
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2127-H | codeforces | 2127-H | 23 Rises Again | https://codeforces.com/problemset/problem/2127/H | [
"brute force",
"dfs and similar",
"dp",
"flows",
"graph matchings",
"graphs",
"greedy",
"implementation",
"probabilities",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 851
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2127-G2 | codeforces | 2127-G2 | Inter Active (Hard Version) | https://codeforces.com/problemset/problem/2127/G2 | [
"binary search",
"bitmasks",
"constructive algorithms",
"graphs",
"implementation",
"interactive",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2127-G1 | codeforces | 2127-G1 | Inter Active (Easy Version) | https://codeforces.com/problemset/problem/2127/G1 | [
"binary search",
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 107
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2127-F | codeforces | 2127-F | Hamed and AghaBalaSar | https://codeforces.com/problemset/problem/2127/F | [
"brute force",
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1265
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2127-E | codeforces | 2127-E | Ancient Tree | https://codeforces.com/problemset/problem/2127/E | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3057
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2127-D | codeforces | 2127-D | Root was Built by Love, Broken by Destiny | https://codeforces.com/problemset/problem/2127/D | [
"combinatorics",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6453
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2127-C | codeforces | 2127-C | Trip Shopping | https://codeforces.com/problemset/problem/2127/C | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12826
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2127-B | codeforces | 2127-B | Hamiiid, Haaamid... Hamid? | https://codeforces.com/problemset/problem/2127/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13653
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2127-A | codeforces | 2127-A | Mix Mex Max | https://codeforces.com/problemset/problem/2127/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20005
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2126-G2 | codeforces | 2126-G2 | Big Wins! (hard version) | https://codeforces.com/problemset/problem/2126/G2 | [
"binary search",
"data structures",
"divide and conquer",
"dsu",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1187
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2126-G1 | codeforces | 2126-G1 | Big Wins! (easy version) | https://codeforces.com/problemset/problem/2126/G1 | [
"binary search",
"data structures",
"dp",
"dsu",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2503
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2126-F | codeforces | 2126-F | 1-1-1, Free Tree! | https://codeforces.com/problemset/problem/2126/F | [
"brute force",
"data structures",
"dfs and similar",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4347
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2126-E | codeforces | 2126-E | G-C-D, Unlucky! | https://codeforces.com/problemset/problem/2126/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17195
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2126-D | codeforces | 2126-D | This Is the Last Time | https://codeforces.com/problemset/problem/2126/D | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 24221
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2126-C | codeforces | 2126-C | I Will Definitely Make It | https://codeforces.com/problemset/problem/2126/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26492
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2126-B | codeforces | 2126-B | No Casino in the Mountains | https://codeforces.com/problemset/problem/2126/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38010
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2126-A | codeforces | 2126-A | Only One Digit | https://codeforces.com/problemset/problem/2126/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 51643
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2125-F | codeforces | 2125-F | Timofey and Docker | https://codeforces.com/problemset/problem/2125/F | [
"binary search",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 406
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2125-E | codeforces | 2125-E | Sets of Complementary Sums | https://codeforces.com/problemset/problem/2125/E | [
"brute force",
"combinatorics",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1426
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:2125-D | codeforces | 2125-D | Segments Covering | https://codeforces.com/problemset/problem/2125/D | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9382
} | 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.