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:2144-A | codeforces | 2144-A | Cut the Array | https://codeforces.com/problemset/problem/2144/A | [
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21563
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2143-F | codeforces | 2143-F | Increasing Xor | https://codeforces.com/problemset/problem/2143/F | [
"bitmasks",
"data structures",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 410
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2143-E | codeforces | 2143-E | Make Good | https://codeforces.com/problemset/problem/2143/E | [
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1861
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2143-D2 | codeforces | 2143-D2 | Inversion Graph Coloring (Hard Version) | https://codeforces.com/problemset/problem/2143/D2 | [
"binary search",
"combinatorics",
"data structures",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2732
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2143-D1 | codeforces | 2143-D1 | Inversion Graph Coloring (Easy Version) | https://codeforces.com/problemset/problem/2143/D1 | [
"combinatorics",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6335
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2143-C | codeforces | 2143-C | Max Tree | https://codeforces.com/problemset/problem/2143/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 13975
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2143-B | codeforces | 2143-B | Discounts | https://codeforces.com/problemset/problem/2143/B | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20684
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2143-A | codeforces | 2143-A | All Lengths Subtraction | https://codeforces.com/problemset/problem/2143/A | [
"brute force",
"two pointers"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20586
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2141-I | codeforces | 2141-I | Color the Tree | https://codeforces.com/problemset/problem/2141/I | [
"*special"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 55
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2141-H | codeforces | 2141-H | Merging Vertices in a Graph | https://codeforces.com/problemset/problem/2141/H | [
"*special",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 83
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2141-G | codeforces | 2141-G | Good Robot Paths | https://codeforces.com/problemset/problem/2141/G | [
"*special",
"data structures",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 61
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2141-F | codeforces | 2141-F | Array Reduction | https://codeforces.com/problemset/problem/2141/F | [
"*special",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 136
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2141-E | codeforces | 2141-E | Perfect Cut | https://codeforces.com/problemset/problem/2141/E | [
"*special",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 255
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2141-D | codeforces | 2141-D | Avoid Minimums | https://codeforces.com/problemset/problem/2141/D | [
"*special",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 469
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2141-C | codeforces | 2141-C | Minimum on Subarrays | https://codeforces.com/problemset/problem/2141/C | [
"*special",
"brute force"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 342
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2141-B | codeforces | 2141-B | Games | https://codeforces.com/problemset/problem/2141/B | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 1409
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2141-A | codeforces | 2141-A | Furniture Store | https://codeforces.com/problemset/problem/2141/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 1594
} | 2026-04-13T03:38:27.662191+00:00 |
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": 301
} | 2026-04-13T03:38:27.662191+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": 1222
} | 2026-04-13T03:38:27.662191+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": 2074
} | 2026-04-13T03:38:27.662191+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": 4851
} | 2026-04-13T03:38:27.662191+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": 12256
} | 2026-04-13T03:38:27.662191+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": 21977
} | 2026-04-13T03:38:27.662191+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": 22138
} | 2026-04-13T03:38:27.662191+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": 20731
} | 2026-04-13T03:38:27.662191+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": 25687
} | 2026-04-13T03:38:27.662191+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": 80
} | 2026-04-13T03:38:27.662191+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": 183
} | 2026-04-13T03:38:27.662191+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": 237
} | 2026-04-13T03:38:27.662191+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": 632
} | 2026-04-13T03:38:27.662191+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": 3330
} | 2026-04-13T03:38:27.662191+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": 5384
} | 2026-04-13T03:38:27.662191+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": 5289
} | 2026-04-13T03:38:27.662191+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": 16882
} | 2026-04-13T03:38:27.662191+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": 1914
} | 2026-04-13T03:38:27.662191+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": 4018
} | 2026-04-13T03:38:27.662191+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": 10072
} | 2026-04-13T03:38:27.662191+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": 19367
} | 2026-04-13T03:38:27.662191+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": 22735
} | 2026-04-13T03:38:27.662191+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": 26270
} | 2026-04-13T03:38:27.662191+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": 35093
} | 2026-04-13T03:38:27.662191+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": 20802
} | 2026-04-13T03:38:27.662191+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": 25986
} | 2026-04-13T03:38:27.662191+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": 242
} | 2026-04-13T03:38:27.662191+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": 149
} | 2026-04-13T03:38:27.662191+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": 227
} | 2026-04-13T03:38:27.662191+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": 985
} | 2026-04-13T03:38:27.662191+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": 2394
} | 2026-04-13T03:38:27.662191+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": 3844
} | 2026-04-13T03:38:27.662191+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": 7288
} | 2026-04-13T03:38:27.662191+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": 18190
} | 2026-04-13T03:38:27.662191+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": 637
} | 2026-04-13T03:38:27.662191+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": 2372
} | 2026-04-13T03:38:27.662191+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": 3620
} | 2026-04-13T03:38:27.662191+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": 18535
} | 2026-04-13T03:38:27.662191+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": 20726
} | 2026-04-13T03:38:27.662191+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": 26435
} | 2026-04-13T03:38:27.662191+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": 458
} | 2026-04-13T03:38:27.662191+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": 1657
} | 2026-04-13T03:38:27.662191+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": 7419
} | 2026-04-13T03:38:27.662191+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": 12692
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2133-B | codeforces | 2133-B | Villagers | https://codeforces.com/problemset/problem/2133/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25420
} | 2026-04-13T03:38:27.662191+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": 30806
} | 2026-04-13T03:38:27.662191+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": 508
} | 2026-04-13T03:38:27.662191+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": 2724
} | 2026-04-13T03:38:27.662191+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": 7512
} | 2026-04-13T03:38:27.662191+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": 8746
} | 2026-04-13T03:38:27.662191+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": 13236
} | 2026-04-13T03:38:27.662191+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": 27563
} | 2026-04-13T03:38:27.662191+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": 33304
} | 2026-04-13T03:38:27.662191+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": 43055
} | 2026-04-13T03:38:27.662191+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": 873
} | 2026-04-13T03:38:27.662191+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": 3720
} | 2026-04-13T03:38:27.662191+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": 4694
} | 2026-04-13T03:38:27.662191+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": 16919
} | 2026-04-13T03:38:27.662191+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": 14145
} | 2026-04-13T03:38:27.662191+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": 21486
} | 2026-04-13T03:38:27.662191+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": 30807
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:2131-A | codeforces | 2131-A | Lever | https://codeforces.com/problemset/problem/2131/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 38677
} | 2026-04-13T03:38:27.662191+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": 21263
} | 2026-04-13T03:38:27.662191+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": 28419
} | 2026-04-13T03:38:27.662191+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": 95
} | 2026-04-13T03:38:27.662191+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": 129
} | 2026-04-13T03:38:27.662191+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": 466
} | 2026-04-13T03:38:27.662191+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": 941
} | 2026-04-13T03:38:27.662191+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": 1652
} | 2026-04-13T03:38:27.662191+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": 2481
} | 2026-04-13T03:38:27.662191+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": 3830
} | 2026-04-13T03:38:27.662191+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": 13144
} | 2026-04-13T03:38:27.662191+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": 16528
} | 2026-04-13T03:38:27.662191+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": 375
} | 2026-04-13T03:38:27.662191+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": 787
} | 2026-04-13T03:38:27.662191+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": 6501
} | 2026-04-13T03:38:27.662191+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": 12171
} | 2026-04-13T03:38:27.662191+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": 20429
} | 2026-04-13T03:38:27.662191+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": 21263
} | 2026-04-13T03:38:27.662191+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": 28391
} | 2026-04-13T03:38:27.662191+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": 563
} | 2026-04-13T03:38:27.662191+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": 104
} | 2026-04-13T03:38:27.662191+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": 99
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.